News for hackers. Stuff that matters.
Re:LibBF – a small library to handle arbitrary precision flo... by siegelzero on Tuesday March 06, 2018 @05:32PM (#16532703)
There are some closely related difficult problems. Consider the fraction a/b, and let r be the length of the repeating fractional part. Then r <= b - 1. Moreover, if r == b - 1, then b is prime. In general, r divides phi(b), where phi is the Euler phi function.

There are no comments on this comment yet.