id:A070667 - OEIS Search Results

Search: id:A070667

Displaying 1-1 of 1 results found.

page 1

Smallest m in range 2..n-1 such that m^2 == 1 mod n, or 1 if no such number exists.

+0
13

1, 1, 2, 3, 4, 5, 6, 3, 8, 9, 10, 5, 12, 13, 4, 7, 16, 17, 18, 9, 8, 21, 22, 5, 24, 25, 26, 13, 28, 11, 30, 15, 10, 33, 6, 17, 36, 37, 14, 9, 40, 13, 42, 21, 19, 45, 46, 7, 48, 49, 16, 25, 52, 53, 21, 13, 20, 57, 58, 11, 60, 61, 8, 31, 14, 23, 66, 33, 22 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`If n has a primitive root (i.e. if n is in A033948(n)) then a(n)=n-1, if not (i.e. if n is in A033949(n)), a(n)<n-1. E.g.: if n is of the form 4*A000961(m), then a(n)=n/2-1. Questions : for which n does the equation A070667(x)=x-n have at least one solution, does always A070667(x)=x-p have at least one solution when p is prime =>5? - Benoit Cloitre (benoit7848c(AT)orange.fr), May 12 2002`
	CROSSREFS	`Cf. A033948, A033949, A000961.` `Sequence in context: A070675 A096894 A097751 this_sequence A122416 A134665 A063260` `Adjacent sequences: A070664 A070665 A070666 this_sequence A070668 A070669 A070670`
	KEYWORD	`nonn`
	AUTHOR	`njas, May 08 2002`

page 1

Search completed in 0.002 seconds

Last modified September 7 12:28 EDT 2008. Contains 143483 sequences.

AT&T Labs Research