![](data:image/svg+xml;utf8,<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" viewBox="0 0 72 71" width="72"></svg>)
Who can help me explain how to prove that there are infinitely many primes Let a = p1p2 × ×pn+1 But a cannot be replaced by P1, P2 So a is a prime, But 2 * 3 * 5 * 7 * 11 * 13 + 1 = 30031 can be divisible. How is this proof right
Let's assume that there are finite prime numbers, P1, P2 Except for these, there are no other prime numbers. Your examples are only 2 * 3 * 5 * 7 * 11 * 13. 30031 = 59 * 509 is not included. Many proofs miss this premise. Prime numbers P1, P2... PN make a = p1p2 × X PN + 1A can't be just a prime number, otherwise
RELATED INFORMATIONS
- 1. How to prove that there are infinitely many primes?
- 2. Prove that prime numbers are infinite
- 3. Find such a prime number, when it adds 10 and 14, it is still prime
- 4. A number a is prime, and a + 10, a + 14 are also prime. How much is a? A number a is prime, and a + 10, a + 14 are also prime. How much is a? Use elementary formula Help me
- 5. The number a is prime, and both a + 10 and a + 14 are prime. What is the number a?
- 6. How to prove that a number is prime?
- 7. How to prove whether a number is prime or not in many ways To prove whether a number is a prime, for example, to prove whether the integer n is a prime, let I = 2 and do the divisor in turn until I
- 8. How to quickly verify whether a number is prime Find out a random number, how to quickly determine whether it is a prime? The main idea of the algorithm can be required
- 9. Is there such a prime number, which is still prime if it is added with 10 and 14 respectively? If so, there are () prime numbers
- 10. If a ^ n - 1 is a prime, prove that a = 2 and N is a prime
- 11. How to prove that there are infinitely many primes It's urgent
- 12. It is proved that there are infinitely many primes in the form of 6K + 5 Write specific process, hope to list different ways to prove. The best way to prove the contrary!
- 13. Please prove that there are infinitely many prime numbers
- 14. It is proved that there are infinitely many prime numbers of type 4k-1 I'm studying and researching the mathematical thought of group theory and studying Zhang Guangxiang's book. I can't do this exercise I believe that the essence of mathematical research is no different from other knowledge. The key point of problem solving lies in the depth of our understanding of existing simple and similar problems. In fact, there are many examples to illustrate the essential characteristics and laws of an abstract concept. Mathematicians need to study every aspect carefully in order to deeply grasp a concept, thought and method I'm not a professional mathematician, and I lack this kind of environment and energy. But I'm born with a very deep understanding and passion for mathematics. For example, group, such concepts and ideas are really amazing I want 4k-1, not 4K + 1. For example, 7 is not 4K + 1. My knowledge of number theory is very limited,
- 15. It is known that the sum of two natural numbers is 900, and the product of their greatest common divisor and least common multiple is 432
- 16. Why is the product of two numbers equal to the product of the greatest common divisor and the least common multiple of the two numbers?
- 17. How to prove that the product of two numbers is equal to the product of the greatest common divisor and the least common multiple?
- 18. The greatest common divisor of two natural numbers is 15, and the least common multiple is 180. What are the two natural numbers? Please use the common factor and common multiple method to solve, thank you
- 19. There are two natural numbers whose greatest common factor is 8 and least common multiple is 240. These two natural numbers may be () and () or () and ()
- 20. The greatest common factor of two natural numbers is 8, and the least common multiple is 120. The minimum difference between the two numbers is (), and the maximum is ()