I was inspired by your exploits with lambda calculus and decided to write my first recursive method in Ruby!
Project Euler #14 seemed like the perfect problem to start with:
The following iterative sequence is defined for the set of positive integers:
n → n/2 (n is even) n → 3n + 1 (n is odd)
| The Longue Durée Ring | |
| ======== | |
| “To know all the evidence. Ideally the student should never consider less than the total of the historical material which may conceivably be relevant to his enquiry. Though in many circumstances this will be an impossible counsel of perfection, it remains the only proper ambition.” | |
| —G.R. Elton, _The Practice of History_ | |
| Who are we? | |
| ----------- | |
| We're a book club. We try to take the long view. Join us! |
| adfd |