|
Search: id:A033948
|
|
|
| A033948 |
|
Numbers that have a primitive root. |
|
+0
15
|
|
| 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 17, 18, 19, 22, 23, 25, 26, 27, 29, 31, 34, 37, 38, 41, 43, 46, 47, 49, 50, 53, 54, 58, 59, 61, 62, 67, 71, 73, 74, 79, 81, 82, 83, 86, 89, 94, 97, 98, 101, 103, 106, 107, 109, 113, 118, 121, 122, 125, 127, 131, 134, 137, 139
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Sequence gives values of n such that x^2 == 1 (mod n) has no solution with 1<x<n-1. - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 04 2002
|
|
REFERENCES
|
I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers, 4th edition, page 62, Theorem 2.25.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
Anonymous, Notes on Number Theory:Primitive Roots
Math Reference Project, Primitive Root
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Wolfram Research, Prime Roots
Eric Weisstein's World of Mathematics, Modulo Multiplication Group
|
|
FORMULA
|
The sequence consists of 1, 2, 4 and numbers of the form p^i and 2p^i, where p is an odd prime and i >= 1.
|
|
CROSSREFS
|
Cf. A033949, A072209.
Sequence in context: A048627 A152757 A062462 this_sequence A117730 A123101 A071557
Adjacent sequences: A033945 A033946 A033947 this_sequence A033949 A033950 A033951
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Calculated by Jud McCranie (j.mccranie(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
