← Complete problem index

PROJECT EULER · #0735

Divisors of 2n2

Statement only · UnsolvedOriginal problem ↗

Let f(n) be the number of divisors of 2n2 that are no greater than n. For example, f(15)=8 because there are 8 such divisors: 1,2,3,5,6,9,10,15. Note that 18 is also a divisor of 2×152 but it is not counted because it is greater than 15.

Let F(N)=n=1Nf(n). You are given F(15)=63, and F(1000)=15066.

Find F(1012).

Write-up coming later

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