相关论文: A century problem related to the Legendre symbol m…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

A classical problem in analytic number theory is to study the distribution of $\alpha p$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is…

The theory of $p$-modulus provides a general framework for quantifying the richness of a family of objects on a graph. When applied to the family of spanning trees, $p$-modulus has an interesting probabilistic interpretation. In particular,…

A possible method to solve the sign problem is developed by modifying the original theory. Considering several modifications of the partition function, the observable in the original theory is reconstructed from the identity connecting the…

Lucas' theorem describes how to reduce a binomial coefficient $\binom{a}{b}$ modulo $p$ by breaking off the least significant digits of $a$ and $b$ in base $p$. We characterize the pairs of these digits for which Lucas' theorem holds modulo…

In this paper, we establish the following two congruences: \begin{gather*} \sum_{k=0}^{(p+1)/2}(3k-1)\frac{\left(-\frac{1}{2}\right)_k^2\left(\frac{1}{2}\right)_k4^k}{k!^3}\equiv…

In this short note we look at the problem of counting juggling patterns with one ball or two balls with a throw at every occurrence. We will do this for both traditional juggling and for spherical juggling. In the latter case we will show a…

For any positive integer $n$ and variables $a$ and $x$ we define the generalized Legendre polynomial $P_n(a,x)=\sum_{k=0}^n\b ak\b{-1-a}k(\frac{1-x}2)^k$. Let $p$ be an odd prime. In the paper we prove many congruences modulo $p^2$ related…

We have designed a new symbolic-numeric strategy to compute efficiently and accurately floating point Puiseux series defined by a bivariate polynomial over an algebraic number field. In essence, computations modulo a well chosen prime $p$…

In this paper, we prove a conjecture of the second author by evaluating the determinant $$\det\left[x+\left(\frac{i-j}p\right)+\left(\frac ip\right)y+\left(\frac jp\right)z+\left(\frac{ij}p\right)w\right]_{0\le i,j\le(p-3)/2}$$ for any odd…

Let $p>3$ be a prime. We investigate Legendre symbol of $\displaystyle \prod_{0<i<j<p/2 \atop p\nmid f(i,j) } f(i,j) \ $, where $i,j\in \Bbb Z, f(i,j)$ is a linear or quadratic form with integer coefficients. When $f=ai^2+bij+cj^2$ and…

We prove two determinant evaluations attached to Sun's conjectures on matrices of Legendre symbols. The first one resolves the \(p\equiv1\pmod4\) part of Conjecture 4.8(i) by reducing the determinant with four indeterminates to a four-entry…

For a simple connected graph $G$ of order $n$, a bijective function $f:V(G)\to\{1,2,\cdots,n\}$ is said to be a Legendre cordial labeling modulo $p$, where $p$ is an odd prime, if the induced function $f_p^*:E(G)\to \{0,1\}$, defined by…

Determinants with Legendre symbol entries have close relations with character sums and elliptic curves over finite fields. In recent years, Sun, Krachun and his cooperators studied this topic. In this paper, we confirm some conjectures…

Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…

The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a…

Let $p>3$ be a prime, and let $d\in\mathbb Z$ with $p\nmid d$. For the determinants $$S_m(d,p)=\det\left[(i^2+dj^2)^{m}\right]_{1\leqslant i,j \leqslant (p-1)/2}\ \ \left(\frac{p-1}2\leqslant m\leqslant p-1\right),$$ Sun recently determined…

A Lehmer number modulo a prime $p$ is an integer $a$ with $1 \leq a \leq p-1$ whose inverse $\bar{a}$ within the same range has opposite parity. Lehmer numbers that are also primitive roots have been discussed by Wang and Wang in an…

Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…

We consider the problem of recovering a hidden monic polynomial f(X) of degree d > 0 over the finite field F of p elements given a black box which, for any x in F, evaluates the quadratic character of f(x). We design a classical algorithm…