id:A103491 - OEIS Search Results

Search: id:A103491

Displaying 1-1 of 1 results found.

page 1

Multiplicative suborder of 5 (mod n) = sord(5, n).

+0
1

0, 0, 1, 1, 1, 0, 1, 3, 2, 3, 0, 5, 2, 2, 3, 0, 4, 8, 3, 9, 0, 3, 5, 11, 2, 0, 2, 9, 6, 7, 0, 3, 8, 10, 8, 0, 6, 18, 9, 4, 0, 10, 3, 21, 5, 0, 11, 23, 4, 21, 0, 16, 4, 26, 9, 0, 6, 18, 7, 29, 0, 15, 3, 3, 16, 0, 10, 11, 16, 11, 0, 5, 6, 36, 18, 0, 9, 30, 4, 39, 0, 27, 10, 41, 6, 0, 21, 7, 10, 22, 0 (list; graph; listen)

	OFFSET	`0,8`
	COMMENT	`a(n) is minimum e for which 5^e = +/-1 mod n, or zero if no e exists.`
	REFERENCES	`H. Cohen, Course in Computational Algebraic Number Theory, Springer, 1993, p. 25, Algorithm 1.4.3`
	LINKS	`H. J. Smith, XICalc - Extra Precision Integer Calculator.` `Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics, Multiplicative Order.` `S. Wolfram, Algebraic Properties of Cellular Automata (1984), Appendix B.` `Eric Weisstein's World of Mathematics, Suborder Function`
	CROSSREFS	`Sequence in context: A047160 A093347 A134676 this_sequence A089306 A086099 A048967` `Adjacent sequences: A103488 A103489 A103490 this_sequence A103492 A103493 A103494`
	KEYWORD	`easy,nonn`
	AUTHOR	`Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 08 2005`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research