answersLogoWhite

0

I dont know?

Ans 2.

Well, Euclid knew, 2,000 years ago. He proved that whatever number you choose there is always a prime bigger than that number. Here's his proof, modified to deal with googolplex.

Make a list of all the primes that are smaller than googolplex. Multiply them all together, then add one. It's a big number - let's call it BIGNO.
Take any prime from the list and divide it into BIGNO. There will always be a remainder of one. No prime from the list divides BIGNO. That means that BIGNO is either prime, or is the product of two or more primes greater than googolplex. Either way there is a prime greater than googolplex.

User Avatar

Wiki User

15y ago

Still curious? Ask our experts.

Chat with our AI personalities

CoachCoach
Success isn't just about winning—it's about vision, patience, and playing the long game.
Chat with Coach
BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi

Add your answer:

Earn +20 pts
Q: Is there a prime number greater than googolplex?
Write your answer...
Submit
Still have questions?
magnify glass
imp