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 755cd55 commit ab9ae2eCopy full SHA for ab9ae2e
project_euler/problem_095/sol1.py
@@ -100,7 +100,9 @@ def multiply(
100
min_prime_degree += 1
101
primes_degrees[min_prime] = min_prime_degree
102
103
- new_sum = prev_sum * min_prime + (prev_sum + prev_num) * (min_prime - 1) // (min_prime ** min_prime_degree - 1)
+ new_sum = prev_sum * min_prime + (prev_sum + prev_num) * (min_prime - 1) // (
104
+ min_prime**min_prime_degree - 1
105
+ )
106
assert new_sum == sum_primes(primes_degrees=primes_degrees, num=num), (
107
f"{num} {primes_degrees} {prev_num} {min_prime} {prev_num} {new_sum} {sum_primes(primes_degrees=primes_degrees, num=num)}"
108
)
0 commit comments