Project Euler/245
From charlesreid1
Problem Statement
Coresilience
We shall call a fraction that cannot be cancelled down a resilient fraction.
Furthermore we shall define the coresilience of a denominator d, denoted by C(d), as the sum of all numerators n (1 ≤ n < d) for which n/d is a resilient fraction.
Find the sum of all composite integers 1 < d ≤ 2×10^11 for which C(d) is a divisor of d - 1.
Flags