Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
A new proof of Euclid's theorem by using set-theoretical concept
View through CrossRef
A prime number is a natural number greater than 1 that has no divisors other than 1 anditself. The fact that there are infinitely many prime numbers (Euclid's theorem) was proven byEuclid around 300 BC, and by 2022, about 200 different proof methods have beendiscovered. In Euclid's proof, a number obtained by adding 1 to the factorial of a prime isused. This paper will demonstrate the existence of new factors in natural numbers below acertain prime factorial, thereby proving that prime numbers are infinite using only set-theoretical concepts. In addition, this paper proves Euclid's theorem without assuming thatthere are a finite number of prime numbers.
Title: A new proof of Euclid's theorem by using set-theoretical concept
Description:
A prime number is a natural number greater than 1 that has no divisors other than 1 anditself.
The fact that there are infinitely many prime numbers (Euclid's theorem) was proven byEuclid around 300 BC, and by 2022, about 200 different proof methods have beendiscovered.
In Euclid's proof, a number obtained by adding 1 to the factorial of a prime isused.
This paper will demonstrate the existence of new factors in natural numbers below acertain prime factorial, thereby proving that prime numbers are infinite using only set-theoretical concepts.
In addition, this paper proves Euclid's theorem without assuming thatthere are a finite number of prime numbers.
Related Results
Charles Peirce and Bertrand Russell on Euclid
Charles Peirce and Bertrand Russell on Euclid
Both Charles Sanders Peirce (1839–1914) and Bertrand Russell (1872–1970) held that Euclid’s proofs in geometry were fundamentally flawed, and based largely on mathematical intuitio...
Can a computer proof be elegant?
Can a computer proof be elegant?
In computer science, proofs about computer algorithms are par for the course. Proofs
by
computer algorithms, on the other hand, are not so readily accepted....
On free proof and regulated proof
On free proof and regulated proof
Free proof and regulated proof are two basic modes of judicial proof. The system of ‘legal proof’ established in France in the 16th century is a classical model of regulated proof....
Complexity Theory
Complexity Theory
The workshop
Complexity Theory
was organised by Joachim von zur Gathen (Bonn), Oded Goldreich (Rehovot), Claus-Peter Schnorr (Frankfurt), and Madhu Sudan ...
(Invited) A 1-mG MEMS Sensor
(Invited) A 1-mG MEMS Sensor
MEMS (microelectromechanical systems) technology has contributed substantially to the miniaturization of inertial sensors, such as accelerometers and gyroscopes [1]. Nowadays, MEMS...
Limits of proof in criminal proceedings
Limits of proof in criminal proceedings
Problem setting. Proving in criminal proceedings is evidence collection and research activity of special subjects of criminal proceedings. The specific purpose of prooving is to ob...
Sherlock Holmes: Other Sciences
Sherlock Holmes: Other Sciences
Sherlock Holmes knew more chemistry than any other science. But in this chapter, we shall find that he was well informed in a number of other sciences as well. Since mathematics co...