We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e5a2fbf commit fe0b493Copy full SHA for fe0b493
project_euler/problem_095/sol1.py
@@ -100,7 +100,10 @@ def multiply(
100
min_prime_degree += 1
101
primes_degrees[min_prime] = min_prime_degree
102
103
- new_sum = (prev_sum * (min_prime ** (min_prime_degree + 1) - 1) + prev_num * (min_prime ** min_prime_degree - 1)) // (min_prime - 1)
+ new_sum = (
104
+ prev_sum * (min_prime ** (min_prime_degree + 1) - 1)
105
+ + prev_num * (min_prime**min_prime_degree - 1)
106
+ ) // (min_prime - 1)
107
assert new_sum == sum_primes(primes_degrees=primes_degrees, num=num)
108
chain[num] = new_sum
109
0 commit comments