Prove or disprove: Is 10^1,000 - 9 Prime?

  • Thread starter Thread starter srfriggen
  • Start date Start date
  • Tags Tags
    Prime
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
9 replies · 3K views
srfriggen
Messages
304
Reaction score
7

Homework Statement



Prove or disprove: Is 10^1,000 - 9 Prime?


Homework Equations





The Attempt at a Solution



10^1,000 = 999...91.

Is there a way to logically argue to drop the first nine hundred ninety eight 9's and just look at 91 as being a prime?
 
Physics news on Phys.org
srfriggen said:

Homework Statement



Prove or disprove: Is 10^1,000 - 9 Prime?


Homework Equations





The Attempt at a Solution



10^1,000 = 999...91.

Is there a way to logically argue to drop the first nine hundred ninety eight 9's and just look at 91 as being a prime?
No.
Notice that 101000 is a perfect square, and so is 9.
 
You would think that might work.
However:
91 is prime
991 is prime
9991 = 103*97, but both of these are prime factors
99991 is prime
999991 = ?
 
Mark44 said:
No.
Notice that 101000 is a perfect square, and so is 9.

But the difference between two perfect squares isn't always prime. For example, 25-16=9.

Not following the logic yet :/
 
srfriggen said:
But the difference between two perfect squares isn't always prime. For example, 25-16=9.

Not following the logic yet :/

What can you do with the difference of two squares?
 
srfriggen said:
But the difference between two perfect squares isn't always prime. For example, 25-16=9.

Not following the logic yet :/

That's why he answered "No" to the question of whether it's prime!
 
Mark44 said:
What can you do with the difference of two squares?

LOL he gave away the answer then!

I've gotten to this point now: "Call 10^1,000 x^2 and 9=3^2. x2-32=(x+3)(x-3)."

Thinking a proof by contradiction technique may work but mulling it over I can't see how (x+3)(x-3)=p, where p is prime, would lead to a contradiction. If I'm on the right path let me know and I'll try to work it out some more.
 
srfriggen said:
LOL he gave away the answer then!

I've gotten to this point now: "Call 10^1,000 x^2 and 9=3^2. x2-32=(x+3)(x-3)."

Thinking a proof by contradiction technique may work but mulling it over I can't see how (x+3)(x-3)=p, where p is prime, would lead to a contradiction. If I'm on the right path let me know and I'll try to work it out some more.

You should just start writing down what you know about prime numbers, you should write down the relevant point fairly quickly.
 
  • Like
Likes   Reactions: 1 person
Office_Shredder said:
You should just start writing down what you know about prime numbers, you should write down the relevant point fairly quickly.

"...(x+3)(x-3)=N, and N is divisible by (x+3) OR (x-3). It cannot be prime since a prime is only divisible by itself and the number 1."

that work?
 
That sounds reasonable, except I'm not sure why you use the word OR when describing what N is divisible why... and would be more appropriate.
 
  • Like
Likes   Reactions: 1 person