Can the Product of All Primes Before p Be Greater Than p^2?

  • Thread starter Thread starter cap.r
  • Start date Start date
  • Tags Tags
    Primes
Click For Summary
SUMMARY

The discussion centers on the inequality between the square of a prime number \( p \) (where \( p > 11 \)) and the product of all primes preceding it. Specifically, for \( p = 13 \), it is established that \( 13^2 = 169 \) is less than the product \( 3 \times 5 \times 7 \times 11 = 1155 \). The participants agree that the product of the first \( N \) primes grows significantly faster than the square of the \( N \)-th prime, supporting the assertion that this inequality holds true for primes greater than 11.

PREREQUISITES
  • Understanding of prime numbers and their properties
  • Familiarity with mathematical inequalities
  • Knowledge of the product of primes and its growth rate
  • Basic concepts of number theory, particularly co-primality
NEXT STEPS
  • Study the growth rates of prime products versus polynomial functions
  • Explore the concept of the Prime Number Theorem
  • Investigate the properties of the ring of numbers co-prime to \( n \)
  • Learn about inequalities involving prime numbers and their applications in number theory
USEFUL FOR

Mathematicians, number theorists, and students studying advanced topics in prime number theory will benefit from this discussion, particularly those interested in inequalities involving prime numbers.

cap.r
Messages
64
Reaction score
0

Homework Statement


I am proving something different and need this to be true.

choose prime p > 11. then p^2 is less than the product of all primes that came before it.


Homework Equations


U(n)= {1, a_1, ... a_k} this is the ring of numbers co prime to n.

ex: let p=13. 13^2 = 169<3*5*7*11

The Attempt at a Solution



I am using 11 because it's not generally true for primes less than 11 and I have dealt with those cases in my proof.

is this generally correct? is there a simple proof I should show? or take it as general knowledge.
 
Physics news on Phys.org
The "product of the first N primes" function grows so ridiculously fast as compared to the "square of the N-th prime" function, that pretty much any approximation at all should be usable to prove the inequality.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 16 ·
Replies
16
Views
3K
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 19 ·
Replies
19
Views
5K
Replies
3
Views
2K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
4
Views
2K
  • · Replies 36 ·
2
Replies
36
Views
2K