Search arXivSearch

arXiv · 2007.06453

Proof of three conjectures on determinants related to quadratic residues

Abstract

In this paper we confirm three conjectures of Z.-W. Sun on determinants. We first show that any odd integer $n>3$ divides the determinant $$\left|(i^2+dj^2)\left(\frac{i^2+dj^2}n\right)\right|_{0\le i,j\le (n-1)/2},$$ where $d$ is any integer and $(\frac{\cdot}n)$ is the Jacobi symbol. Then we prove some divisibility results concerning $|(i+dj)^n|_{0\le i,j\le n-1}$ and $|(i^2+dj^2)^n|_{0\le i,j\le n-1}$, where $d\not=0$ and $n>2$ are integers. Finally, for any odd prime $p$ and integers $c$ and $d$ with $p\nmid cd$, we determine completely the Legendre symbol $(\frac{S_c(d,p)}p)$, where $S_c(d,p):=|(\frac{i^2+dj^2+c}p)|_{1\le i,j\le(p-1)/2}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Darij Grinberg, Zhi-Wei Sun, Lilu Zhao. 2020-11-16. Proof of three conjectures on determinants related to quadratic residues. https://arxiv.org/abs/2007.06453

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT