Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079853
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079853 Primes p for which (p-2)! == 1 mod p^2. +0
4
2, 3, 11, 107, 4931 (list; graph; listen)
OFFSET

1,1

COMMENT

Similarly to Wilson's theorem which states that (p-1)! == -1 mod p for every prime p, we can prove that (p-2)! == 1 mod p for every prime p. For the primes 2, 3, 11, 107, 4931 the above relations also holds mod p^2

Zhi-Wei SUN conjectures that all terms except 2 are == 3 mod 8 (Posting to the Number Theory Mailing List, Nov 02 2009; added by njas, Nov 02 2009)

CROSSREFS

Sequence in context: A117699 A065378 A161721 this_sequence A050721 A058114 A042337

Adjacent sequences: A079850 A079851 A079852 this_sequence A079854 A079855 A079856

KEYWORD

nonn,more,new

AUTHOR

Pavlos Saridis (pavlos19(AT)yahoo.com), Sep 13 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research