Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^2: A mod2 Machine.

by code-ninja (Scribe)
on Jul 12, 2013 at 12:16 UTC ( #1043950=note: print w/ replies, xml ) Need Help??


in reply to Re: A mod2 Machine.
in thread A mod2 Machine.

hmm... hmm... umm... I said this algorithm will work for all bases of the form 2^n and base 10. But according to you, this algorithm will work if the base is of the form 2*n. I'll just clarify right after commenting. Hold on...

UPDATE

apologies, my assumption was wrong. This algorithm will work, i.e. produce correct output, if the base is of the form 2*n.


Comment on Re^2: A mod2 Machine.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (6)
As of 2014-12-28 06:55 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (179 votes), past polls