← Complete problem index

PROJECT EULER · #0942

Mersenne's Square Root

Statement only · UnsolvedOriginal problem ↗

Given a natural number q, let p=2q1 be the q-th Mersenne number.

Let R(q) be the minimal square root of q modulo p, if one exists. In other words, R(q) is the smallest positive integer x such that x2q is divisible by p.

For example, R(5)=6 and R(17)=47569.

Find R(74207281). Give your answer modulo 109+7.

Note: 2742072811 is prime.

Write-up coming later

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