mod,prime -> inverse possible
Posted
by Piet
on Stack Overflow
See other posts from Stack Overflow
or by Piet
Published on 2010-05-19T20:11:14Z
Indexed on
2010/05/19
20:20 UTC
Read the original article
Hit count: 311
Hi all. I was wondering if one can do the following:
We have:
X
is a product ofN
-primes, thus I assume unique.C
is a constant. We can assure thatC
is a number that is part of theN
-primes or not. Whichever will work best.
Thus:
X mod C = Z
We have Z
and C
and we know that X
was a product of N
-primes, where N
is restricted lets say first 100 primes.
Is there anyway we can get back X
?
© Stack Overflow or respective owner