cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A227971 Determinant of the (p_n+1)/2 X (p_n+1)/2 matrix with (i,j)-entry (i,j=0,...,(p_n-1)/2) being the Legendre symbol((i+j)/p_n), where p_n is the n-th prime.

Original entry on oeis.org

-1, 2, 8, 32, 96, -1024, 512, 2048, 40960, 32768, 1572864, -33554432, 2097152, 8388608, 234881024, 536870912, 20937965568, 8589934592, 34359738368, -73392401154048, 549755813888, 2199023255552, -8796093022208000, -1577385769486516224, 11258999068426240
Offset: 2

Views

Author

Zhi-Wei Sun, Aug 01 2013

Keywords

Comments

Conjecture: If p_n == 1 (mod 4), then a(n) == ((p_n-1)/2)! (mod p_n). If p_n == 3 (mod 4), then a(n) == (2/p_n) (mod p_n).
Zhi-Wei Sun also made the following general conjecture:
Let p be any odd prime. For each integer d let R(d,p) be the determinant of the (p+1)/2-by-(p+1)/2 matrix whose (i,j)-entry (i,j = 0,...,(p-1)/2) is the Legendre symbol ((i+d*j)/p). When p == 3 (mod 4), we have R(d,p) == (2/p) (mod p) if (d/p) = 1, and R(d,p) == 1 (mod p) if (d/p) = -1. In the case p == 1 (mod 4), we have R(c^2*d,p) == (c/p)*R(d,p) (mod p) for any integer c, and R(d,p) == 1 or -1 (mod p) if (d/p) = -1.
The author could prove that for any odd prime p and integer d not divisible by p, the determinant of the (p-1)-by-(p-1) matrix with (i,j)-entry (i,j=1,...,p-1) being the Legendre symbol ((i+dj)/p) has the exact value (-d/p)*p^{(p-3)/2}.
On August 19 2013, Zhi-Wei Sun found a formula for a(n). Namely, he made the following conjecture: If p_n == 1 (mod 4) and e(p_n)^{h(p_n)} = (a_n + b_n*sqrt(p_n))/2 with a_n and b_n integers of the same parity (where e(p_n) and h(p_n) are the fundamental unit and the class number of the quadratic field Q(sqrt(p_n)) respectively), then a(n) = - (2/p_n)*2^{(p_n-3)/2}*a_n. If p_n > 3 and p_n == 3 (mod 4), then a(n) = 2^{(p_n-1)/2}.
On August 19 2013, Zhi-Wei Sun proved all the conjectured congruences mentioned above by using the identity D(c,d,n) = (-d)^{n*(n+1)/2}*(n!)^{n+1}, where D(c,d,n) is the (n+1) X (n+1) determinant with (i,j)-entry equal to (i+d*j+c)^n for all i,j = 0,...,n. For any prime p == 1 (mod 4) he showed that R(d,p) == (d*(d/p))^{(p-1)/4}*((p-1)/2)! (mod p). Note also that the formula for a(n) found by Sun on August 9, 2013 is actually equivalent to Chapman's result on the evaluation of the determinant |((i+j-1)/p)|_{i,j=1,...,(p+1)/2}.

Examples

			a(2) = -1 since the determinant |((i+j)/3)|_{i=0,1; j=0,1}| equals -1.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := Det[Table[JacobiSymbol[i+j, Prime[n]], {i, 0, (Prime[n]-1)/2}, {j, 0, (Prime[n]-1)/2}]]; Table[a[n], {n, 2, 30}]
  • PARI
    a(n) = my(p=prime(n)); matdet(matrix((p+1)/2, (p+1)/2, i, j, i--; j--; kronecker(i+j, p))); \\ Michel Marcus, Aug 25 2021

A225611 Determinant of the (p_n-1) X (p_n-1) matrix with (i,j)-entry equal to the Legendre symbol ((i^2+6*i*j+j^2)/p_n), where p_n is the n-th prime.

Original entry on oeis.org

0, -16, 0, 0, 0, 18939904, 0, 0, -600706205614080, 0, -3126394312091238400, 915844279166632469526048000, 0, 0, 1513783909437524991467008819200000000, 0, -6597762875255062617688526826958066024448000, 0, 0
Offset: 2

Views

Author

Zhi-Wei Sun, Aug 11 2013

Keywords

Comments

Conjecture: We have a(n) = 0 if p_n == 3 (mod 4).
For an odd prime p and integers c and d, Zhi-Wei Sun defined (c,d)_p to be the determinant of the (p-1) X (p-1) matrix whose (i,j)-entry is the Legendre symbol ((i^2+c*i*j+d*j^2)/p). It is easy to see that (-c,d)_p = (-1/p)*(c,d)_p. Sun conjectured that for any integer c and nonzero integer d there are infinitely many odd primes p with (c,d)_p = 0, moreover (c,d)_p = 0 if (d/p) = -1. He also formulated some concrete conjectures in the case (d/p) = 1. For example, (3,3)_p = 0 if p == 11 (mod 12), and (10,9)_p = 0 if p == 5 (mod 12); (3,2)_p = (4,2)_p = 0 if p == 7 (mod 8).
On August 12 2013, Zhi-Wei Sun conjectured that for any odd prime p and integers c and d with d not divisible by p, if (c,d)_p is nonzero then its p-adic valuation (i.e., p-adic order) must be even.

Crossrefs

Programs

  • Mathematica
    a[n_]:=Det[Table[JacobiSymbol[i^2+6*i*j+j^2,Prime[n]],{i,1,(Prime[n]-1)},{j,1,(Prime[n]-1)}]]
    Table[a[n],{n,2,20}]
  • PARI
    a(n) = my(p=prime(n)); matdet(matrix(p-1, p-1, i, j, kronecker(i^2+6*i*j+j^2, p))); \\ Michel Marcus, Aug 25 2021

A228095 Determinant of the p_n X p_n matrix with (i,j)-entry equal to the Legendre symbol ((i^2 + 3*i*j + 3*j^2)/p_n) for all i,j = 0, 1, ..., p_n-1, where p_n is the n-th prime.

Original entry on oeis.org

0, 0, -72, 0, 9600, 0, 23970816, 0, 0, -8814759178752000000, -1217765613534782800527360, 0, 2555625991208076641833058304, 0, 0, 0, 164525463228624478317575381527120287356682240, -33094833021317386202938131485140597289779200, 0
Offset: 2

Views

Author

Zhi-Wei Sun, Aug 12 2013

Keywords

Comments

Conjecture: a(n) = 0 if p_n == 5 (mod 6).
For an odd prime p and integers c and d, Zhi-Wei Sun defined [c,d]_p to be the determinant of the p X p matrix with (i,j)-entry equal to the Legendre symbol ((i^2+c*i*j+d*j^2)/p). It is easy to see that [-c,d]_p = (-1/p)*[c,d]_p. Sun conjectured that for any integer c and nonzero integer d there are infinitely many odd primes p with [c,d]_p = 0. He also conjectured that if (c,d)_p (defined in the comments in A225611) is nonzero with d not divisible by p, then [c,d]_p/(c,d)_p equals (1-p)/(p-2) or (p-1)/2 according as p divides c^2-4*d or not. He also made some concrete conjectures, for example, [3,2]_p = 0 if p == 3 (mod 4); and [4,2]_p = 0 if p == 5 or 7 (mod 8).
On Aug 12 2013, Zhi-Wei Sun conjectured that for any odd prime p and integers c and d with d not divisible by p, if [c,d]_p is nonzero then its p-adic valuation (i.e., p-adic order) must be even.

Crossrefs

Programs

  • Mathematica
    a[n_]:=Det[Table[JacobiSymbol[i^2+3*i*j+3*j^2,Prime[n]],{i,0,(Prime[n]-1)},{j,0,(Prime[n]-1)}]]
    Table[a[n],{n,2,20}]
  • PARI
    a(n) = my(p=prime(n)); matdet(matrix(p, p, i, j, i--; j--; kronecker(i^2+3*i*j+3*j^2, p))); \\ Michel Marcus, Aug 25 2021
Showing 1-3 of 3 results.