Coresilience Created 2026-10-20 Updated 2026-11-05
For an integer , the coresilience is
where is Euler's totient function.[ref] It is related to the resilience of a denominator , but is not its complement:
For a prime number , but , rather than zero. For the composite number fifteen, and .
As , the value is a unit fraction precisely when divides . A composite prime power with cannot qualify: its value is , already a reduced fraction with numerator greater than one. This excludes an entire family of composite numbers before a search.
Resilience of a denominator Created 2026-10-20 Updated 2026-11-05
For an integer , the resilience of a denominator is the fraction of its proper fractions already in lowest terms. The fraction is a reduced fraction exactly when and are coprime, so
where is Euler's totient function.
For , the allowed numerators are , giving . A prime denominator has resilience one. Conversely, a composite number has a proper prime divisor , and is among the listed fractions but is not reduced; thus its resilience is strictly less than one.
The prime factorization formula gives
The correction comes from sampling the positive proper numerators, rather than all residue classes. The related coresilience uses .