One way to prove that there are innitely many prime
Chapter 4, Problem 4.261(choose chapter or problem)
One way to prove that there are innitely many prime numbers is to assume that there is a largest prime number p, construct the number _____, and then show that this numberhastobedivisiblebyaprimenumberthatisgreaterthan _____.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer