← Complete problem index

PROJECT EULER · #0064

Odd Period Square Roots

Statement only · SolvedOriginal problem ↗

All square roots are periodic when written as continued fractions and can be written in the form:

N=a0+1a1+1a2+1a3+

For example, let us consider 23:

23=4+234=4+11234=4+11+2337

If we continue we would get the following expansion:

23=4+11+13+11+18+

The process can be summarised as follows:

a0=4,1234=23+47=1+2337a1=1,7233=7(23+3)14=3+2332a2=3,2233=2(23+3)14=1+2347a3=1,7234=7(23+4)7=8+234a4=8,1234=23+47=1+2337a5=1,7233=7(23+3)14=3+2332a6=3,2233=2(23+3)14=1+2347a7=1,7234=7(23+4)7=8+234

It can be seen that the sequence is repeating. For conciseness, we use the notation 23=[4;(1,3,1,8)], to indicate that the block (1,3,1,8) repeats indefinitely.

The first ten continued fraction representations of (irrational) square roots are:

2=[1;(2)], period=1
3=[1;(1,2)], period=2
5=[2;(4)], period=1
6=[2;(2,4)], period=2
7=[2;(1,1,1,4)], period=4
8=[2;(1,4)], period=2
10=[3;(6)], period=1
11=[3;(3,6)], period=2
12=[3;(2,6)], period=2
13=[3;(1,1,1,1,6)], period=5

Exactly four continued fractions, for N13, have an odd period.

How many continued fractions for N10000 have an odd period?

Write-up coming later

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