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 be a positive integer. Since and are consecutive integers, they must be coprime, and hence the number must have at least two different prime factors. Similarly, since the integers and are consecutive, and therefore coprime, the number must have at least 3 different prime factors. This can be continued indefinitely.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
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
That's really nice!!!
Darn I have to come up with something like that. :P
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 !
Thas' a cool rearrangement o' what we learn in school....
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
Amazing!
really
Log in to reply
:)
dang
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.
That's really nice!!!
If ϕ(n)n−1 is an integer then prove that no prime
p
gives integer value when p2n.the interesting thing of primes is that we could come with even simpler proofs of primes and extricating proofs too of primes simpler than that proof of infinite primes infinitude of primes by euclid and still after 2000 years gone by after euclid
Log in to reply
Still on schedule for launch on November 30
clap clap clap
Euclid proves the same by induction over 2000 years ago
Log in to reply
Isn't it proof by contradiction ?
2^prime-1= prime..That means there r infinite prime no.s
Log in to reply
2p−1 is not always prime for p being prime. Eg : 211−1=2047=23×89. So, your statement does not actually prove infinite number of primes.