[seqfan] Re: relation A033984 and A173138, solutions of mod n equations
maximilian.hasler at gmail.com
Sun Feb 21 15:50:41 CET 2010
I think the title of
Composite numbers n such that the congruence 2^(n-4)=1 (mod n) is solvable
is not well chosen ( ... solvable -> solution to ... ?!)
if n is odd, then 2^4 is invertible mod n so both equations are equivalent.
and there can't be a solution > 4 to the 2nd equation (...=1) for
even n (which is explicitly excluded in A033984).
On Sun, Feb 21, 2010 at 3:34 PM, Richard Mathar
<mathar at strw.leidenuniv.nl> wrote:
> How are these two sequences related?
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan