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

linter fix

Browse Source
This commit is contained in:
lukew3
2020-10-21 14:39:44 -04:00
parent d647e9710f
commit abddf069c2
3 changed files with 3 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
mathgenerator/funcs/complex_to_polar.py
View File

@@ -9,7 +9,7 @@ def complexToPolarFunc(minRealImaginaryNum=-20, maxRealImaginaryNum=20):
r = round(math.hypot(a, b), 2) r = round(math.hypot(a, b), 2)
theta = round(math.atan2(b, a), 2) theta = round(math.atan2(b, a), 2)
plr = str(r) + "exp(i" + str(theta) + ")" plr = str(r) + "exp(i" + str(theta) + ")"
problem = f"rexp(itheta) = " problem = "rexp(itheta) = "
solution = plr solution = plr
return problem, solution return problem, solution

3
mathgenerator/funcs/decimal_to_roman_numerals.py
View File

@@ -25,8 +25,7 @@ def decimalToRomanNumeralsFunc(maxDecimal=4000):
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)

3
mathgenerator/funcs/nth_fibonacci_number.py
View File

@@ -5,8 +5,7 @@ def nthFibonacciNumberFunc(maxN=100):
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 = round((math.pow(golden_ratio, n) - math.pow(-golden_ratio, -n)) / (math.sqrt(5)))
(math.sqrt(5)))
solution = f"{ans}" solution = f"{ans}"
return problem, solution return problem, solution