Given some integer k, define the sequence an=(nk). Claim: an is periodic modulo a prime p with the period being the least power pe of p such that $k
In other words, an+pe≡an(mod p). But the period pe is smaller than I'd have expected (it is obvious that a period satisfying k!<pe would work). So how can I prove that it works?
No comments:
Post a Comment