Re: Recurring Cycle of Fractions (tiny)

in reply to Recurring Cycle of Fractions

Such boring limitations, as previously noted. But monstrously large floating points and regexes? Bah. It is simple enough to compute directly using boringly small integers:

#!/usr/bin/perl -w
use strict;
my( $num, $den )= ( 1, 7, @ARGV )[2&@ARGV,-1];
my $rem= $num % $den;
my %seen;
my $rep= '';
while(  1  ) {
    $rem *= 10;
    last
        if  exists $seen{$rem};
    $seen{$rem}= length( $rep );
    $rep .= int( $rem / $den );
    $rem %= $den;
}
substr( $rep, 0, $seen{$rem} )= '';
print "$num / $den = ...$rep\n";
[download]

Sample runs:

 $ perl repDig.pl 97
1 / 97 = ...010309278350515463917525773195876288659793
814432989690721649484536082474226804123711340206185567

 $ perl repDig.pl 2 97
2 / 97 = ...020618556701030927835051546391752577319587
628865979381443298969072164948453608247422680412371134
[download]

- tye

In Section Seekers of Perl Wisdom