← Complete problem index

PROJECT EULER · #0132

Large Repunit Factors

Statement only · SolvedOriginal problem ↗

A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k.

For example, R(10)=1111111111=11×41×271×9091, and the sum of these prime factors is 9414.

Find the sum of the first forty prime factors of R(109).

Write-up coming later

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