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

lint fixes

Browse Source
This commit is contained in:
lukew3
2021-10-06 10:47:44 -04:00
parent 1b5054f6d3
commit 05b61130da
8 changed files with 12 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
mathgenerator/funcs/basic_math/cube_root.py
View File

@@ -6,8 +6,7 @@ def cubeRootFunc(minNo=1, maxNo=1000, format='string'):
a = b**(1 / 3) a = b**(1 / 3)
if format == 'string': if format == 'string':
return ("What is the cube root of " + str(b) + return "What is the cube root of " + str(b) + " up to 2 decimal places?", str(round(a, 2))
" up to 2 decimal places?", str(round(a, 2)))
elif format == 'latex': elif format == 'latex':
return (f"\\(\\sqrt[3]{{{b}}}=\\)", "\\(" + str(round(a, 2)) + "\\)") return (f"\\(\\sqrt[3]{{{b}}}=\\)", "\\(" + str(round(a, 2)) + "\\)")
else: else:

6
mathgenerator/funcs/basic_math/divide_fractions.py
View File

@@ -32,14 +32,14 @@ def divideFractionsFunc(maxVal=10, format='string'):
if format == 'string': if format == 'string':
return f"({a}/{b})/({c}/{d})", x return f"({a}/{b})/({c}/{d})", x
elif format == 'latex': elif format == 'latex':
problem = "\\(\\frac{" + str(a) + "}{" + str(b) + \
"}\\div\\frac{" + str(c) + "}{" + str(d) + "}=\\)"
if tmp_d == 1 or tmp_d == gcd: if tmp_d == 1 or tmp_d == gcd:
solution = "\\(" + str(sol_numerator) + "\\)" solution = "\\(" + str(sol_numerator) + "\\)"
else: else:
solution = "\\(\\frac{" + str(sol_numerator) + \ solution = "\\(\\frac{" + str(sol_numerator) + \
"}{" + str(sol_denominator) + "}\\)" "}{" + str(sol_denominator) + "}\\)"
return ("\\(\\frac{" + str(a) + "}{" + str(b) + \ return problem, solution
"}\\div\\frac{" + str(c) + "}{" + str(d) + "}=\\)",
solution)
else: else:
return a, b, c, d, x return a, b, c, d, x

3
mathgenerator/funcs/computer_science/nth_fibonacci_number.py
View File

@@ -7,8 +7,7 @@ def nthFibonacciNumberFunc(maxN=100, format='string'):
golden_ratio = (1 + math.sqrt(5)) / 2 golden_ratio = (1 + math.sqrt(5)) / 2
n = random.randint(1, maxN) n = random.randint(1, maxN)
problem = f"What is the {n}th Fibonacci number?" problem = f"What is the {n}th Fibonacci number?"
ans = round((math.pow(golden_ratio, n) - math.pow(-golden_ratio, -n)) / ans = int((math.pow(golden_ratio, n) - math.pow(-golden_ratio, -n)) / (math.sqrt(5)))
(math.sqrt(5)))
if format == 'string': if format == 'string':
solution = f"{ans}" solution = f"{ans}"

3
mathgenerator/funcs/misc/decimal_to_roman_numerals.py
View File

@@ -26,8 +26,7 @@ def decimalToRomanNumeralsFunc(maxDecimal=4000, format='string'):
elif last_value == 4: elif last_value == 4:
solution += (roman_dict[divisor] + roman_dict[divisor * 5]) solution += (roman_dict[divisor] + roman_dict[divisor * 5])
elif 5 <= last_value <= 8: elif 5 <= last_value <= 8:
solution += (roman_dict[divisor * 5] + (roman_dict[divisor] * solution += (roman_dict[divisor * 5] + (roman_dict[divisor] * (last_value - 5)))
(last_value - 5)))
elif last_value == 9: elif last_value == 9:
solution += (roman_dict[divisor] + roman_dict[divisor * 10]) solution += (roman_dict[divisor] + roman_dict[divisor * 10])
x = math.floor(x % divisor) x = math.floor(x % divisor)