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

Printable View

- May 6th 2010, 05:32 PMrahulnaiduIt 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

- May 6th 2010, 05:35 PMdwsmith
- May 6th 2010, 05:38 PMrahulnaidu
sorry u could take that way

- May 6th 2010, 05:43 PMrahulnaidu
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

- May 6th 2010, 05:43 PMdwsmith
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? - May 6th 2010, 05:45 PMrahulnaidu
am also trying for some time now couldn't figure it out.

- May 6th 2010, 06:08 PMrahulnaidu
if it is divisible by 2 times,4times,6 times, like that

- May 6th 2010, 06:10 PMrahulnaidu
- May 8th 2010, 09:52 AMdwsmith
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?