I've got a little problem with the following assignment. I would be very grateful if anyone could at least give me some hint on how to do it.
There are given different odd prime numbers http://www.mymathforum.com/cgi-bin/mimetex.cgi?p and http://www.mymathforum.com/cgi-bin/mimetex.cgi?q. Prove that number http://www.mymathforum.com/cgi-bin/m...Bpq%7D%20-%201 has at least 3 different prime factors.
Thank you very much!
Originally Posted by PaulinaAnna
Mersenne prime - Wikipedia, the free encyclopedia (subheading Generalization)
By the way I've marked this thread to be moved to the Number Theory subforum.
Let and be positive integers, if , then .
Also, for any positive integers and , if , then .
Apply these two lemmas in the same order they're written...
Thank you guys very much.
It's already solved :)
Hey, I'm wondering how did you solve this problem? I'm interested, I tried with Mersenne numbers, but I didn't manage to prove that this number has at least 3 prime divisors.
Anyway, I got it. It was quite easy.
Err... No. My question remains- I "solved" it in the wrong way, now I realised. How to prove this fact?