It is generally believed that infinitely many primes have the form N^2+1, although no one knows for sure. Do you think that there are infinitely many primes of the form N^2-1? -
![CPSC 490 Number Theory Primes, Factoring and Euler Phi-function Mar.31 st, 2006 Sam Chan. - ppt download CPSC 490 Number Theory Primes, Factoring and Euler Phi-function Mar.31 st, 2006 Sam Chan. - ppt download](https://images.slideplayer.com/24/7542813/slides/slide_4.jpg)
CPSC 490 Number Theory Primes, Factoring and Euler Phi-function Mar.31 st, 2006 Sam Chan. - ppt download
![Understanding Euclid's proof of the infinity of primes by showing rules for how new primes can be introduced. : r/learnmath Understanding Euclid's proof of the infinity of primes by showing rules for how new primes can be introduced. : r/learnmath](https://i.imgur.com/rq8wILP.png)
Understanding Euclid's proof of the infinity of primes by showing rules for how new primes can be introduced. : r/learnmath
![number theory - A question in proof of result that there are infinitely many primes of form $8a-1$. - Mathematics Stack Exchange number theory - A question in proof of result that there are infinitely many primes of form $8a-1$. - Mathematics Stack Exchange](https://i.stack.imgur.com/Xivdl.jpg)
number theory - A question in proof of result that there are infinitely many primes of form $8a-1$. - Mathematics Stack Exchange
![infinitude, Euclid, Kummer, Stieltjes, Goldbach, Schorn, Euler, Perott, Auric, Metrod, Prime Number, number theory 31/1 Sideway output.to infinitude, Euclid, Kummer, Stieltjes, Goldbach, Schorn, Euler, Perott, Auric, Metrod, Prime Number, number theory 31/1 Sideway output.to](http://www.output.to/Sideway/images/knowledge/mathematics/number/numbering/primenumber_001a.png)
infinitude, Euclid, Kummer, Stieltjes, Goldbach, Schorn, Euler, Perott, Auric, Metrod, Prime Number, number theory 31/1 Sideway output.to
![logic - Can't understand the logical structure of Euclid's infinitely many primes proof in Rosen's book. - Mathematics Stack Exchange logic - Can't understand the logical structure of Euclid's infinitely many primes proof in Rosen's book. - Mathematics Stack Exchange](https://i.stack.imgur.com/ZcWgd.png)
logic - Can't understand the logical structure of Euclid's infinitely many primes proof in Rosen's book. - Mathematics Stack Exchange
![Computational Number Theory - traditional number theory Prime Numbers Factors Counting Factors D- functions. - ppt download Computational Number Theory - traditional number theory Prime Numbers Factors Counting Factors D- functions. - ppt download](https://slideplayer.com/slide/8100512/25/images/19/Theorem%3A+There+are+infinitely+many+prime+numbers..jpg)