Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Recurring Cycle of Fractions

by steph (Initiate)
on Oct 18, 2012 at 14:17 UTC ( #999743=note: print w/replies, xml ) Need Help??


in reply to Recurring Cycle of Fractions

There you go
#!/usr/bin/perl use strict; use warnings; use bignum ( p => -9999 ); # this is huge, by the way my $limit = shift; # 1000 for project euler my $longest = 1; my $value; for my $val (1..$limit) { my $frac = 1/$val; if (reverse($frac) =~ /(\d+)\1+/) { my $longestSubChain = reverse($1); if ($longestSubChain =~ /(\d+?)\1+/) { if (length($1) > $longest) { $longest = length +($1); $value = $val; } } } } print "d = $value\n"; print "Longest recurring cycle: $longest";

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://999743]
help
Chatterbox?
[Eily]: s/complete ness/complete mess/ :P
[Eily]: and you can overload "0+" rather than bool, as numification is used instead of stringification in boolean context when available

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (11)
As of 2017-07-27 14:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I came, I saw, I ...
























    Results (415 votes). Check out past polls.