Here is a really neat proof of the infinitude of primes! It's so simple that it makes me say: "Why didn't I think of it?". In fact, it was made just in 2005, by Filip Saidak, and I was really surprised to know that. So here is the proof:

Let \(n > 1\) be a positive integer. Since \(n\) and \(n+1\) are consecutive integers, they must be coprime, and hence the number \(N_2 = n(n + 1)\) must have at least two different prime factors. Similarly, since the integers \(n(n+1)\) and \(n(n+1)+1\) are consecutive, and therefore coprime, the number \(N_3 = n(n + 1)[n(n + 1) + 1]\) must have at least 3 different prime factors. This can be continued indefinitely.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestThat's really nice!!!

Darn I have to come up with something like that. :P

Log in to reply

A different proof also exists for the almost same result and with the same concept , apparently.

The proof goes as -

Why didn't I think of it !Log in to reply

Thas' a cool rearrangement o' what we learn in school....

Log in to reply

It seems that the proof shown is for infinitude of composite numbers. I fail to see how it shows that there are infinite number of primes,using this proof??

Log in to reply

if continued indefinitely, the proof is saying that there is a never ending list of composite numbers with a never ending list of unique prime factors. It is different than a proof by contradiction of a largest prime, and is more like a proof of an infinite number of prime factors

Log in to reply

That's really nice!!!

Log in to reply

I wish to know the proof of this geometric problem. Given a scalene triangle on the sides of which are drawn equilateral triangles having the sides of the given triangle as a side. Prove that the triangle formed by connecting the center of gravity of the three equilateral triangle is equilateral.

Log in to reply

I was unable to sow the proof of this geometric problem. I wish someone can help me.

Log in to reply

2^prime-1= prime..That means there r infinite prime no.s

Log in to reply

\(2^p-1\) is not always prime for \(p\) being prime. Eg : \(2^{11}-1=2047=23 \times 89\). So, your statement does not actually prove infinite number of primes.

Log in to reply

dang

Log in to reply

really

Log in to reply

:)

Log in to reply

Amazing!

Log in to reply

Euclid proves the same by induction over 2000 years ago

Log in to reply

Isn't it proof by contradiction ?

Log in to reply