On May 2, 10:03 am, chan <chalon...@[EMAIL PROTECTED]
> wrote:
> What should be done to find these values?
Particularly since the base is so small, it would be easiest to just
calculate the values explicitly (4 mod 5, 4^2 mod 5, ...) until until
you get a repeat. There can only be at most 5 values - since that is
all the values any set of integers modulo 5 can have. A clever person
will not wait for a repeat, but rather for a 0 or 1 value to appear
(in either case, the next step will be a repeat value.
In general, if the base is small, this brute-force approach is
probably fastest.
|
