Re: Length of repeating series of digits in rational numbers
- From: "Ignacio Larrosa Caņestro" <ilarrosaQUITARMAYUSCULAS@xxxxxxxxxxx>
- Date: Sun, 14 Dec 2008 22:21:48 +0100
johngross wrote:
Hi all,
Given two integers i,j expressed to an arbitrary radix r;
Is it possible to calculate the length of the repeating digits of the
rational fraction i/j? in advance? without having to actually work
through it until the digits start repeating?
If so, I would very much like to know how.
Thanks in advance.
johngross
The length is the orden k of r mod j. I.e., k is the minimun exponet as r^k
= 1 (mod j). This is a divisor of phi(j), the euler totient function that
says how many numbers less than j are relative primes to j.
--
Best regards,
Ignacio Larrosa Cañestro
A Coruña (España)
ilarrosaQUITARMAYUSCULAS@xxxxxxxxxxx
.
- Follow-Ups:
- Re: Length of repeating series of digits in rational numbers
- From: johngross
- Re: Length of repeating series of digits in rational numbers
- References:
- Length of repeating series of digits in rational numbers
- From: johngross
- Length of repeating series of digits in rational numbers
- Prev by Date: Re: "decomposition" of diffeomorphism
- Next by Date: Re: Those who use libel are criminals.
- Previous by thread: Length of repeating series of digits in rational numbers
- Next by thread: Re: Length of repeating series of digits in rational numbers
- Index(es):