Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?
 
PerlMonks  

Re: Re^2: Coming soon: Algorithm::Loops (restrictions)

by hv (Parson)
on Apr 14, 2003 at 15:31 UTC ( #250312=note: print w/replies, xml ) Need Help??


in reply to Re^2: Coming soon: Algorithm::Loops (restrictions)
in thread Coming soon: Algorithm::Loops

But with a quick change of a couple of characters, I see that adding up two 4-digit numbers (having the same digits in different orders) never gives us 2003. But of course it can't, because all such would be even modulo 9 while 2003 is odd modulo 9.

Careful now, 7 * 2 = 14 == 5 (modulo 9).

In general (if I remember correctly), for any modulus q, if a does not share a factor with q there exists a b for every c such that a * b == c (modulo q).

Hugo
  • Comment on Re: Re^2: Coming soon: Algorithm::Loops (restrictions)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://250312]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (5)
As of 2021-04-13 11:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?