Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^3: Efficiently working with huge exponents

by wanna_code_perl (Friar)
on Mar 21, 2015 at 13:54 UTC ( [id://1120840]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Efficiently working with huge exponents
in thread Efficiently working with huge exponents

A good observation and valid question, but, no, my calculations are not all powers of 2. Thanks for the math reminder. :-)

  • Comment on Re^3: Efficiently working with huge exponents

Replies are listed 'Best First'.
Re^4: Efficiently working with huge exponents
by BrowserUk (Patriarch) on Mar 21, 2015 at 20:24 UTC

    Can I ask how you are arriving at these huge numbers in your program?


    With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    "Science is about questioning the status quo. Questioning authority". I'm with torvalds on this
    In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked

      Sure. I'm just playing around with some algorithmic approaches to bound some algorithmic complexities. I could have easily left things in a higher-order notation, but since it's just for fun anyway, I wanted to see how far I could push the boundaries of Perl's large number support.

      In other words, I often permit myself to get sidetracked when I'm already sidetracked for fun anyway. :-)

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others about the Monastery: (3)
As of 2024-04-25 20:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found