Thread: It is impossible to solve this basic prime numbers problem

given odd number e find prime p and q such that ((p-1)*(q-1)-1) is evenly divisible by e

Originally Posted by rahulnaidu

given prime number e find prime p and q such that ((p-1)*(q-1)-1) is evenly divisible by e

Could this be worded better as e divides (p-1)(q-1)-1 such where P are prime numbers?

sorry u could take that way

I think it could be solved if some write a code for that, but if some one directly find those 2 numbers then the person math. genius

generates prime numbers so we have.


This what I have though of so far but don't have time to continue so what you can come up with.

So we have . What do you mean be evenly divisible?

am also trying for some time now couldn't figure it out.

if it is divisible by 2 times,4times,6 times, like that

Originally Posted by rahulnaidu

given odd number e find prime p and q such that ((p-1)*(q-1)-1) is evenly divisible by e

sorry i changed the problem it is odd number e not prime number e

If e is odd, then e is of the form .

. Now we have an odd number divides an odd number.

Are we actually looking for numbers or just solving a general case?