Päevaülesanne

Juhuslik

Harjutuskomplekt

Balti Tee 2011 · Valikvooru ülesanne

Arvuteooria

Prove that there exist infinitely many natural numbers nn such that all prime factors of n2+1n^2 + 1 are less than nn.

Muuda valikut

Kui oled valmis

Ülevaatematerjal muutub kättesaadavaks järgmise päevaülesannete komplektiga.

Ülevaade

Teemad

Jaguvus ja tegurdamine · Modulaararitmeetika

Lahendused

Lahendus

It is true for all numbers n=2a2n = 2a^2 where a>1a > 1 and a≡1(mod5)a \equiv 1 \pmod{5}. If n=2a2n = 2a^2 then n2+1=4a4+1=(2a2+2a+1)(2a2−2a+1)n^2 + 1 = 4a^4 + 1 = (2a^2 + 2a + 1)(2a^2 - 2a + 1). As 2a2−2a+1<2a22a^2 - 2a + 1 < 2a^2 it remains to ensure that all prime factors of 2a2+2a+12a^2 + 2a + 1 are less than 2a22a^2. If a≡1(mod5)a \equiv 1 \pmod{5} then 2a2+2a+1≡0(mod5)2a^2 + 2a + 1 \equiv 0 \pmod{5} and therefore 2a2+2a+1=5⋅2a2+2a+152a^2 + 2a + 1 = 5 \cdot \frac{2a^2+2a+1}{5}, both these factors are less than 2a22a^2.