4th Landau's Problem

Dirichlet's theorem states that

For any two coprime positive integers a a and d d , there are infinitely many primes of the form a + n d a + nd , where n n is a non-negative integer.

Argument : There are infinitely many primes of the form n 2 + 1 n^2 + 1 .

Proof : Let n > 0 n > 0 . For n = 1 , n 2 + 1 = 2 n = 1, n^2 + 1 = 2 which is prime. Otherwise, if n 2 + 1 2 n^2 + 1 \neq 2 then n 2 + 1 = ( n ) ( n ) + 1 n^2 + 1 = (n)(n) + 1 and gcd ( n , 1 ) = 1 \gcd(n,1) = 1 . Thus, by Dirichlet's theorem there are infinitely many prime of the form ( n ) ( n ) + 1 (n)(n) + 1 .

Is this proof of argument (4th Landau's problem) correct?

Yes No

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...