deadvey/mathgenerator
1
0
Fork 0
mirror of https://github.com/DeaDvey/mathgenerator.git synced 2025-11-28 14:35:23 +01:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #370 from crrossx/main

Browse Source 
Used faster way to find gcd.
This commit is contained in:
Luke Weiler
2021-10-18 15:31:38 -04:00
committed by GitHub
parent 739d24b8fc 4913ad1453
commit 716c37af94
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
mathgenerator/funcs/geometry/equation_of_line_from_two_points.py
View File

@@ -1,4 +1,5 @@
from .__init__ import * from .__init__ import *
import math
def gen_func(maxCoordinate=20, minCoordinate=-20, format='string'): def gen_func(maxCoordinate=20, minCoordinate=-20, format='string'):
@@ -6,7 +7,7 @@ def gen_func(maxCoordinate=20, minCoordinate=-20, format='string'):
if num2 == 0: if num2 == 0:
return num1 return num1
else: else:
return greatest_common_divisor(num2, num1 % num2) return math.gcd(num2, num1 % num2)
x1 = random.randint(minCoordinate, maxCoordinate) x1 = random.randint(minCoordinate, maxCoordinate)
x2 = random.randint(minCoordinate, maxCoordinate) x2 = random.randint(minCoordinate, maxCoordinate)
@@ -18,7 +19,7 @@ def gen_func(maxCoordinate=20, minCoordinate=-20, format='string'):
coeff_x = (y2 - y1) coeff_x = (y2 - y1)
constant = y2 * coeff_y - x2 * coeff_x constant = y2 * coeff_y - x2 * coeff_x
gcd = greatest_common_divisor(abs(coeff_x), abs(coeff_y)) gcd = math.gcd(abs(coeff_x), abs(coeff_y))
if gcd != 1: if gcd != 1:
if coeff_y > 0: if coeff_y > 0: