A343239 -id:A343239 - cp's OEIS frontend

A343238 All positive integer moduli a(n) for which the congruence x^2 == -5 (mod a(n)) is solvable for integer x (representatives from {0, 1, ..., a(n)-1}); ordered increasingly.

1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 21, 23, 27, 29, 30, 35, 41, 42, 43, 45, 46, 47, 49, 54, 58, 61, 63, 67, 69, 70, 81, 82, 83, 86, 87, 89, 90, 94, 98, 101, 103, 105, 107, 109, 115, 122, 123, 126, 127, 129, 134, 135, 138, 141, 145, 147, 149, 161, 162, 163, 166, 167, 174, 178, 181, 183, 189, 201, 202

Offset: 1

Wolfdieter Lang, May 16 2021

This sequence includes A139513, that is, Legendre(-5, p) = +1 for odd primes not 5, that is, primes congruent to {1, 3, 7, 9} mod 20. Here 5 is a member of the sequence with solution x = 0.
The primes of this sequence are given in A240920.
The present sequence gives the numbers of the form 2^a*5^b*Product_{j=1..m} (p_j)^e(j), with a and b from {0, 1}, p_j a prime from {1, 3, 7, 9} (mod 20), i.e., from A139513, m >= 0 and e(j) >= 0 (this includes the number 1). These numbers are ordered increasingly.
This follows from the Legendre-symbol(-5, p)= +1  and the lifting theorem (see, e.g., Apostol, Theorem 5.30, p. 121-2) for p = 2 and 5 (no lifting for the solutions for p = 2 and p = 5), and the unique lifting for the primes satisfying Legendre-symbol(-5, p) = +1.
Therefore the number of representative solutions x from {0, 1, ..., a(n)-1}, denoted by M(a(n)), is 1 for precisely four cases: a(1) = 1 (x = 0), a(2) = 2  (x = 1), a(4) = 5 (x = 0) and a(8) = 10 = 2*5 (x = 5). For each of the mentioned prime powers there are just 2 solutions. This implies that for the number of solutions in the general a(n) case, n not 1, 2, 4, 8, only the primes p_j are of interest: M(a(n)) = 2^m(n).
For these solutions x see A343239, and for the multiplicity M(a(n)) see A343240.
This congruence is needed to find all proper solutions of the positive definite binary quadratic form of discriminant Disc = -20 = -4*5 representing k = a(n). The solutions x lead to the so-called representative parallel primitive forms (rpapfs). See A344231 for more details.
For a bisection see A344231 and A344232, related to integer solutions of X^2 + 5*Y^2 = A344231(k) and 2*X^2 + 2*X*Y + 3*Y^2 = A344232(k).

			a(3) = 3: two solutions 1 and 2.
a(7) = 3^2 = 9: two solutions 2 and 7.
a(8) = 10 = 2*5 only one solution 5.
a(53) = 135 = 5*3^3: two solutions 20 and 115.

Tom M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, pp 121, 122.

Cf. A139513, A240920, A343239, A343240, A344231, A344232.

isok(k) = issquare(Mod(-5, k)); \\ Michel Marcus, Sep 17 2023

There exists at least one x from {0, 1, ..., m-1} satisfying x^2 + 5 == 0 (mod m), for positive integer m. These m values are then ordered increasingly as (a(n))_{n>=1}.

A343240 The number of solutions x from {0, 1, ..., A343238(n)-1} of the congruence x^2 + 5 == 0 (mod A343238(n)) is given by a(n).

Original entry on oeis.org

1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 4, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 4, 4, 2, 4, 2, 2, 4, 4, 2, 4, 2, 4, 2, 2, 2, 2, 4, 2, 2, 4, 4, 4, 2, 4, 2, 2, 4

Offset: 1

Wolfdieter Lang, May 16 2021

Row length of irregular triangle A343239.

			a(19) = 4 because A343238(19) = 42 = 2*3*7 has 2^(1+1) = 4 solutions from the primes 3 and 7.

Cf. A343238, A343239.

isok(k) = issquare(Mod(-5, k)); \\ A343238
lista(nn) = my(list = List()); for (n=1, nn, if (issquare(Mod(-5, n)), listput(list, sum(i=0, n-1, Mod(i,n)^2 + 5 == 0)););); Vec(list); \\ Michel Marcus, Sep 17 2023

a(n) = row length of A343239(n), for n >= 1.

a(1) = a(2) = a(4) = a(8) = 1, and otherwise a(n) = 2^{number of distinct primes from A139513}, that is, primes congruent to {1, 3, 7, 9} (mod 20), appearing in the prime factorization of A343238(n).

A344231 Positive integers k properly represented by the positive definite binary quadratic form X^2 + 5*Y^2 = k, in increasing order.

Original entry on oeis.org

1, 5, 6, 9, 14, 21, 29, 30, 41, 45, 46, 49, 54, 61, 69, 70, 81, 86, 89, 94, 101, 105, 109, 126, 129, 134, 141, 145, 149, 161, 166, 174, 181, 189, 201, 205, 206, 214, 229, 230, 241, 245, 246, 249, 254, 261, 269, 270, 281, 294, 301, 305, 309, 321, 326, 329, 334, 345, 349, 366, 369, 381, 389, 401, 405

Offset: 1

Wolfdieter Lang, Jun 10 2021

This is one of the bisections of sequence A343238. The other sequence is A344232.
This is a proper subsequence of A020669.
The primes in this sequence are given in A033205.
Discriminant Disc = -20 = -4*5. Class number h(-20) = A000003(5) = 2. The reduced primitive forms representing the two proper (determinant = +1) equivalence classes are the present principal form F1 = [1, 0, 5] and F2 = [2, 2, 3] treated in A344232.
A positive integer k is properly represented by some primitive form of Disc = -20 if and only if the congruence s^2 + 20 == 0 (mod 4*k) has a solution. See, e.g., Buell Proposition 41, p. 50, or Scholz-Schoeneberg Satz 74, p. 105. That is, x^2 + 5 == 0 (mod k), with s = 2*x. For the representative solutions x from {0, 1, ..., k-1}, with k from A343238, see A343239. These solutions x determine the so-called representative parallel primitive forms (rpapfs) [k, 2*x, (x^2 + 5)/k] representing k. They are properly equivalent (via so called R(t)-transformations) to one of the reduced forms F1 or F2. (See also W. Lang's links in A225953 and A324251, but there indefinite forms are considered.)
In order to find out which k from A343238 is represented either by form F1 or F2 the two generic multiplicative characters of Disc = -20, namely Legendre(k|p), with the odd prime p = 5 which divides Disc = -20, and Jacobi(-1|k) can be used. See Buell, pp. 51-52. They lead to the two classes of genera of Disc -20.
The present genus I, the principal one, has for odd primes p, not 5, the values Legendre(p|5) = Legendre(5|p) = +1 and Jacobi(-1|p) = Legendre(-1|p) = +1, leading for odd primes not equal to 5 to A033205. The prime 2 is not represented. The prime 5 is trivially represented. For the other genus II these two characters have values -1. There prime 2 is represented.
For composite k the prime number factorization is used, and for powers of primes the lifting theorem is employed (see, e.g., Apostol, p. 121, Theorem 5.30). The solution for prime 2 represented by form F2 = [2, 2, 3] (from the other genus II) is not liftable to powers of 2. The solution for prime 5 is also not liftable (proof by induction). The solutions of the other primes from A033205 and A106865 are uniquely liftable to powers of these primes. See A343238 for all properly represented k for Disc = -20.
For the present genus I the properly represented integers k are given by 2^a*5^b*Product_{j=1..PI} (pI_j)^(eI(j))*Product_{k=1..PII} (pII_k)^(eII(k)), with a and b from {0, 1} but if PI = PII = 0 (empty products are 1) then a = b = 0 giving a(1) = 1. The odd primes pI_j are from A033205 (== {1, 9} (mod 20)), the primes pII_k are from the odd primes of A106865 (== {3, 7}(mod 20)). The exponents of the second product are restricted: if a = 1 then PII >= 1 and Sum_{k=1..PII} eII(k) is odd. If a = 0 then PII >= 0, and if PII >= 1 then this sum is even.
Neighboring numbers k (twins) begin: [5, 6], [29, 30], [45, 46], [69, 70], [205, 206], [229, 230], [245, 246], [269, 270], [405, 406], ...
For the solutions (X, Y) of F2 = [1, 0, 5] properly representing k = a(n) see A344233.

Tom M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, pp 121 - 122.
D. A. Buell, Binary Quadratic Forms, Springer, 1989.
A. Scholz and B. Schoeneberg, Einführung in die Zahlentheorie, Sammlung Göschen Band 5131, Walter de Gruyter, 1973.

Cf. A000003, A020669, A033205, A106865, A225953, A324251, A343238, A343239, A343240, A344232, A344233.

A344232 All positive integers k properly represented by the positive definite binary quadratic form 2X^2 + 2XY + 3Y^2 = k, in increasing order.

Original entry on oeis.org

2, 3, 7, 10, 15, 18, 23, 27, 35, 42, 43, 47, 58, 63, 67, 82, 83, 87, 90, 98, 103, 107, 115, 122, 123, 127, 135, 138, 147, 162, 163, 167, 178, 183, 202, 203, 207, 210, 215, 218, 223, 227, 235, 243, 258, 263, 267, 282, 283, 287, 290, 298, 303, 307, 315, 322, 327, 335, 343, 347, 362, 367, 378, 383, 387

Offset: 1

Wolfdieter Lang, Jun 10 2021

This is one of the bisections of sequence A343238. The other sequence is A344231.
This is a proper subsequence of A029718.
The primes in this sequence are given in A106865.
See A344231 for more details.
The reduced form [2, 2, 3] represents the proper (determinant +1) equivalence class of one of the two genera (genus II) of discriminant -20. The multiplicative generic characters for discriminant Disc = -20 have values Jacobi(a(n)|5) = -1 and Jacobi(-1|a(n)) = -1, for odd a(n) not divisible by 5. See Buell, p. 52.
The product of any two odd a(n), not divisible by 5, is congruent to {1,5} (mod 8). See Buell, 4),  p. 51.
For this genus II of Disc = -20 the positive integers represented are given by 2^a*5^b*Product_{j=1..PI} (pI_j)^(eI(j))*Product_{k=1..PII}(pII_k)^(eII(k)), with a and b from {0, 1}, but if PI = PII = 0 (empty products are 1) then (a, b) = (1, 0) or (1, 1), giving a(1) = 2 or a(4) = 10. The odd primes pI_j are from A033205 and the odd primes  pII_j from the odd primes of A106865. The exponents of the second product satisfy: if a = 1 then PII >= 0, and if PII >=1 then Sum_{k=1..PII} eII(j) is even. If a = 0 then PII >= 1 and this sum is odd.
The neighboring numbers k (twins) begin: [42, 43], [82, 83], [122, 123] [162, 163], [202, 203], [282, 283], ...
For the solutions (X, Y) of F2 = [2, 2, 3] properly representing k = a(n) see A344234.

D. A. Buell, Binary Quadratic Forms, Springer, 1989.
A. Scholz and B. Schoeneberg, Einführung in die Zahlentheorie, Sammlung Göschen Band 5131, Walter de Gruyter, 1973.

Cf. A029718, A033205, A106865, A343238, A343239, A343240, A344231, A344234.

cp's OEIS Frontend

A343238 All positive integer moduli a(n) for which the congruence x^2 == -5 (mod a(n)) is solvable for integer x (representatives from {0, 1, ..., a(n)-1}); ordered increasingly.

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Programs

PARI

Formula

A343240 The number of solutions x from {0, 1, ..., A343238(n)-1} of the congruence x^2 + 5 == 0 (mod A343238(n)) is given by a(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula

A344231 Positive integers k properly represented by the positive definite binary quadratic form X^2 + 5*Y^2 = k, in increasing order.

Views

Author

Keywords

Comments

References

Crossrefs

A344232 All positive integers k properly represented by the positive definite binary quadratic form 2X^2 + 2XY + 3Y^2 = k, in increasing order.

Views

Author

Keywords

Comments

References

Crossrefs

cp's OEIS Frontend

A343238 All positive integer moduli a(n) for which the congruence x^2 == -5 (mod a(n)) is solvable for integer x (representatives from {0, 1, ..., a(n)-1}); ordered increasingly.

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Programs

PARI

Formula

A343240 The number of solutions x from {0, 1, ..., A343238(n)-1} of the congruence x^2 + 5 == 0 (mod A343238(n)) is given by a(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula

A344231 Positive integers k properly represented by the positive definite binary quadratic form X^2 + 5*Y^2 = k, in increasing order.

Views

Author

Keywords

Comments

References

Crossrefs

A344232 All positive integers k properly represented by the positive definite binary quadratic form 2*X^2 + 2*X*Y + 3*Y^2 = k, in increasing order.

Views

Author

Keywords

Comments

References

Crossrefs

A344232 All positive integers k properly represented by the positive definite binary quadratic form 2X^2 + 2XY + 3Y^2 = k, in increasing order.