Re: Small prime divisors of very large numbers
- --- In email@example.com,
"Mike Oakes" <mikeoakes2@...> wrote:
> Every p appears in the divisor list either zero or oneVery nice!
> or infinitely many times, and in the latter case at places
> that are an arithmetic progression of n values.
Can you give an example where the arithmetic
progression is different from the so-far-observed
case of "every powering after the first appearance"?
- Dear all,
I come back to this topic, looking for a working "pow_mod".
but 2^2^2 % 5 = 16 % 5 = 1.
(and idem for 2^2^2^2 - of course.).
David gave some other code, in
Below is a Pari-GP procedure "pmod(a,m)" to compute
a^(a^(a^ ... ^(a[k-1]^a[k]) ... ) modulo m
where the modulus "m" need not be prime.
Although this may work for prime m
(at least, pmod([2,2,2],5) = Mod(1,5) as should),
= Mod(1, 4)
which is most certainly wrong.
So, to put it short, has anyone a working pmod() in his "library" ?
Thanks in advance!
--- In firstname.lastname@example.org, "David Broadhurst"
I consider that his code should not be trusted.