← Complete problem index

PROJECT EULER · #0779

Prime Factor and Exponent

Statement only · UnsolvedOriginal problem ↗

For a positive integer n>1, let p(n) be the smallest prime dividing n, and let α(n) be its p-adic order, i.e. the largest integer such that p(n)α(n) divides n.

For a positive integer K, define the function fK(n) by: fK(n)=α(n)−1(p(n))K.

Also define fK― by: fK―=limN→∞1N∑n=2NfK(n).

It can be verified that f1―≈0.282419756159.

Find ∑K=1∞fK―. Give your answer rounded to 12 digits after the decimal point.

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.