| Tired of seeing ads? Click here to upgrade to Elite Membership! |
Mathematics Forum
|
| Author | Message / Information |
| StarGhost Quote | Reply | | Finding modulo root of a polynomial posted on: 3/2/2007 9:42:46 AM Hello, I'm experiencing a problem of finding a root for a polynomial f(x) (mod n), i.e., if x0 is a root, then f(x0) = 0 (mod n), that is to say, f(x0) is congruent to 0 modulo n. It's obvious that x0 is within [-n , n]. But since n is a very big number, about 200 decimal digits, any searching has not resulted the solution. Another point is that n is not a prime, since this case has its own solution. All number here including solution, moduls and polynomial parameters are integers. If anyone find an idea, please help me. Thanks a lot. SG. |
|
Euler
Quote | Reply | |
Finding modulo root of a polynomial
replied on: 3/4/2007 1:19:44 AM I assume that you mean n has about 200 digits, not decimal digits, since then it wouldn't be an integer. |
|
LinkBot
|
Gamers Wanted is looking for people to write game reviews and post news, |
|
|
| Tired of seeing ads? Click here to upgrade to Elite Membership! |
ChatArea.com Help & News Forums | Terms of Use | Contact ChatArea.com | Advertising
Powered By ChatArea.com - Get your free Society today! © Copyright 2003 Wewp!