|
| |
|
|
A334819
|
|
The largest nonsquare modulo n with n > 2.
|
|
2
|
|
|
|
2, 3, 3, 5, 6, 7, 8, 8, 10, 11, 11, 13, 14, 15, 14, 17, 18, 19, 20, 21, 22, 23, 23, 24, 26, 27, 27, 29, 30, 31, 32, 31, 34, 35, 35, 37, 38, 39, 38, 41, 42, 43, 44, 45, 46, 47, 48, 48, 50, 51, 51, 53, 54, 55, 56, 56, 58, 59, 59, 61, 62, 63, 63, 65, 66, 67
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
3,1
|
|
|
COMMENTS
|
If p is a prime congruent 3 modulo 4 then a(p) = p - 1 since -1 is not a quadratic residue for such primes.
|
|
|
LINKS
|
Robert Israel, Table of n, a(n) for n = 3..10000
|
|
|
EXAMPLE
|
The squares modulo 3 are 0 and 1. Therefore a(3) = 2. The nonsquares modulo 4 are 2 and 3 which makes a(4) = 3. Modulo 5 we have 0, 1 and 4 as squares giving a(5) = 3. 0, 1 and 4 are also the squares modulo 6 resulting in a(6) = 5. Since 10007 is a prime of the form 4*k + 3, a(10007) = 10006.
|
|
|
MAPLE
|
f:= proc(n) local k;
for k from n-1 by -1 do if numtheory:-msqrt(k, n)=FAIL then return k fi
od
end proc:
map(f, [$3..100]); # Robert Israel, May 14 2020
|
|
|
MATHEMATICA
|
a[n_] := Module[{r}, For[r = n-1, r >= 1, r--, If[!IntegerQ[Sqrt[Mod[r, n]] ], Return[r]]]];
a /@ Range[3, 100] (* Jean-François Alcover, Aug 15 2020 *)
|
|
|
PROG
|
(PARI) a(n) = forstep(r = n - 1, 1, -1, if(!issquare(Mod(r, n)), return(r)))
|
|
|
CROSSREFS
|
Cf. A047210 (the largest square modulo n), A192450 (a(n)=n-1).
Sequence in context: A285719 A070321 A239904 * A338375 A220838 A236294
Adjacent sequences: A334816 A334817 A334818 * A334820 A334821 A334822
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
Peter Schorn, May 12 2020
|
|
|
STATUS
|
approved
|
| |
|
|
