ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1204. Idempotents

Show all messages Hide all messages

Re: I think so happily 28 Aug 2003 20:24
>
Re: I think so NONAME 27 Feb 2006 14:05
NO MATH >>>APPLY MATH
It could be more interesting if n were not only p*q but any number <= 1000000000.
Well I think this way it's somehow more mathematical, cause you can predict some properties of the equations answer.
I absolutely agree with you Kuzmichev_dima 4 Jun 2010 20:19
If I am not mistaken, than solving this problem is as "hard" as factoring n (having 3 or 4th solution you can obtain factorisation of n). Was this problem inspired by RSA?