besides just telling whether it is even/odd and using brute force, how do I find X?
Name:
Anonymous2007-11-15 0:00
sqrt(Z) unmod 10^14 = X
Name:
Anonymous2007-11-15 0:03
unmod? no such thing
Name:
Anonymous2007-11-15 0:06
First sqrt(Z) is X mod 10^14, so X is the combination of sqrt(Z) and any multiples of 10^14
X = sqrt(Z)
enterpassword(X)
for n in range(1, inf):
X += 10^14
if (digit(X) == 26)):
enterpassword(X)
if (digit(X) > 26):
break
Name:
Anonymous2007-11-15 0:07
>>4
I might be wrong, since I read about RSA, and there was a clause about how modulus can never be truly reversed.
Name:
Anonymous2007-11-15 0:09
>>4
and change 26 to 36, didnt read question properly
Name:
Anonymous2007-11-15 0:44
>>5
There is an infinite set of possibilities but most of the time we know the finite limitations so the set is actually bounded in size.
Name:
Anonymous2007-11-15 4:39
This would be more interesting if Z was mod 10^14 too.
Name:
Anonymous2007-11-15 4:44
>>5
It can't be reversed because it loses information, but you can obtain a set of possible original values, and choose the right one based on additional knowledge of the problem, common sense, or trial and error.
Choose an engineer randomly every three months since they decide to distribute it for free probably not gonna happen without the shell first also your vim is anorectic 1 6M is huge especially considering the interpreter is no longer a Scheme interpreter because I will ignore any me wan 0day gruup plxz?