Related papers: A century problem related to the Legendre symbol m…

New formulas for approximation of zeta-constants were derived on the basis of a number-theoretic approach constructed for the irrationality proof of certain classical constants. Using these formulas it's possible to approximate certain…

We use the Burgess bound and Selberg sieve to obtain an upper bound on the second moment of sums over an interval $[u+1,u+h]$ of Legendre symbols modulo primes $p$ in a dyadic interval $[Q,2Q]$. The bound is nontrivial and gives a power…

We propose a new variational formulation of the elliptic Monge-Ampere equation and show how classical Lagrange elements can be used for the numerical resolution of classical solutions of the equation. Error estimates are given for Lagrange…

This paper explores the modulus (discrete $p$-modulus) of the family of edge covers on a discrete graph. This modulus is closely related to that of the larger family of fractional edge covers; the modulus of the latter family is guaranteed…

Suppose that $p$ is an odd prime and $g>1$ is a primitive root modulo $p$. Let $M$ be a number field contained in the $p$-th cyclotomic field. Girstmair found a surprising relation between the relative class number of $M$ and the digits of…

We come back to the construction of p-adic L-functions attached to cusp forms of even weight k in the spirit of G. Stevens, R. Pollack [7] and M. Greenberg [3] with a new unified presentation including the non-ordinary case. This…

We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…

Collatz Conjecture is one of the most famous, for its simple form, proposed more than eighty years ago. This paper presents a full attempt to prove the affirmative answer to the question proposed by the conjecture. In the first section, we…

We primarily investigate congruences modulo $p$ for finite sums of the form $\sum_k\binom{rk}{k}x^k/k$ over the ranges $0<k<p$ and $0<k<p/r$, where $p$ is a prime larger than the positive integer $r$. Here $x$ is an indeterminate, thus…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

In this paper we study some products related to quadratic residues and quartic residues modulo primes. Let $p$ be an odd prime and let $A$ be any integer. We mainly determine completely the product $$f_p(A):=\prod_{1\le i,j\le(p-1)/2\atop…

A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of a…

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…

In this paper, using $p$-adic analysis and $p$-adic L-functions, we show how to extend classical congruences (due to Wilson, Gauss, Dirichlet, Jacobi, Wolstenholme, Glaisher, Morley, Lemher and other people) to modulo $p^k$ for any $k>0$.

The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…

Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…

Let $q > 2$ be a prime number and define $\lambda_q := \left( \frac{\tau}{q} \right)$ where $\tau(n)$ is the number of divisors of $n$ and $\left( \frac{\cdot}{q} \right)$ is the Legendre symbol. When $\tau(n)$ is a quadratic residue modulo…

Thimble regularisation of lattice field theories has been proposed as a solution to the infamous sign problem. It is conceptually very clean and powerful, but it is in practice limited by a potentially very serious issue: in general many…

In this article we estimate the number of integers up to $X$ which can be represented by a positive-definite, binary integral quadratic form of discriminant which is small relative to $X$. This follows from understanding the vector of signs…

In the last ten years, the employment of symbolic methods has substantially extended both the theory and the applications of statistics and probability. This survey reviews the development of a symbolic technique arising from classical…