## Re: Square factors of b^p-1

Expand Messages
• ... Also 3633673^26867849 = 1 mod 53735699^2 21160553^26867849 = 1 mod 53735699^2 David
Message 1 of 81 , Oct 3, 2011

> > Puzzle 3a: Find primes b1 < p1 < q, b2 < p2 < q, b1 < b2, s.t.
> > b1^p1 = b2^p2 = 1 mod q^2, (with no limits on q^2).
>
> At q^2 > 10^15, I found
>
> 1634447^18090263 = 1 mod 36180527^2
> 1773371^18090263 = 1 mod 36180527^2

Also

3633673^26867849 = 1 mod 53735699^2
21160553^26867849 = 1 mod 53735699^2

David
• Hi , all , Not even draft yet , let alone published : http://upforthecount.com/math/nnp.html still needs a lot of work . But , I have updated the top of the
Message 81 of 81 , Nov 29, 2011
Hi , all ,

Not even draft yet , let alone published :
http://upforthecount.com/math/nnp.html
still needs a lot of work .
But , I have updated the top of the main table :
http://upforthecount.com/math/nnp2.txt
with complete factorizations now extending through
np ( 90 ) .

When is np ( n ) prime ?
So far , only for 1 , 2 and 3 .
When n mod 6 = 4 , np ( n ) has at least 3 algebraic
factors , 3 and n^2 + n + 1 ( twice ) .
But what about the residue ( primitive part ? ) ?
When is this prime ?
n t n^n + (n+1)^(n+1)
4 4 3 * 7 * 7 * 23
16 6 3 * 7 * 7 * 13 * 13 * 34041259347101651
Any others ?

Cheers ,

Walter
Your message has been successfully submitted and would be delivered to recipients shortly.