Talk:2^n mod n

2^n mod n = 1

Is 1 the only value of $\scriptstyle c\,$ for which $\scriptstyle 2^{n}{\bmod {n}}\,=\,c\,$ has no solution? Is there such a conjecture? — Daniel Forgues 18:27, 7 July 2011 (UTC)

This was already asked in 2001:

 %C A036236 Labos Elemer (labos(AT)ana.sote.hu) asked on Sept 27, 2001 if all numbers > 1 eventually appear in A015910.

Max Alekseyev 22:43, 13 September 2011 (UTC)

Anchors and formatting

Section titles with formatting, e.g.

== 2<sup>''n''</sup> ≡ ''c'' (mod ''n'') ==

definitively look nicer, but the formatting is not part of the anchor name (which may be misleading, as 2ⁿ becomes 2n) e.g.

#REDIRECT [[2^n mod n#2n ≡ c (mod n)]] 

must be used in the redirect

2^n ≡ c (mod n)

For that reason, it might be better (but not as nice looking) to have

== 2^''n'' ≡ ''c'' (mod ''n'') ==

which may be used as the anchor

#REDIRECT [[2^n mod n#2^n ≡ c (mod n)]] 

— Daniel Forgues 19:19, 29 July 2011 (UTC)

About separate tables

I still think it is cleaner to have two separate tables: one with contiguous values for $\scriptstyle c\,$, one for $\scriptstyle c\,$ as powers of two. — Daniel Forgues 21:57, 4 August 2011 (UTC)

No need (moreover, the two such tables would have huge intersection). Max Alekseyev 22:43, 13 September 2011 (UTC)