1,1

A prime p is an optimus prime if (1 + sqrt( legendre(-1,p)*p ))^p - 1 = r + s*sqrt( legendre(-1,p)*p ) where gcd(r,s) = p.

A. Slinko, Additive representability of finite measurement structures, in "The Mathematics of Preference, Choice and Order: Essays in Honor of Peter Fishburn", edited by Steven Brams, William V. Gehrlein and Fred S. Roberts, Springer, 2009, pp. 113-133.

For p = 13, (1 + sqrt( legendre(-1,p)*p ))^p - 1 = 209588223+58200064*13^(1/2), and gcd(209588223,58200064) = 13, so 13 is an optimus prime.

For p = 23, (1 + sqrt( legendre(-1,p)*p ))^p - 1 = 7453766387236863-24397683359744*(-23)^(1/2), but gcd(7453766387236863,24397683359744) = 1081 != 23, so 23 is a non-optimus prime.

Sequence in context: A098946 A058302 A133213 this_sequence A006598 A106892 A116893

Adjacent sequences: A138462 A138463 A138464 this_sequence A138466 A138467 A138468

nonn,easy,more

N. J. A. Sloane (njas(AT)research.att.com), Feb 07 2009