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

The Bertrand's theorem can be formulated as the solution of an inverse problem for a classical unidimensional motion. We show that the solutions of these problems, if restricted to a given class, can be obtained by solving a numerical…

We prove a classical theorem due to Legendre, about the existence of non trivial solutions of quadratic diophantine equations of the form $ax^2+by^2+cz^2=0$, in the weak fragment of Peano Arithmetic $I\Delta_0+\Omega_1$.

The theta cycle of a modular form modulo a prime $p\geq 5$ is well understood. By contrast, the theta cycle modulo a power of $p$ is still mysterious and experimentally erratic. Here we completely determine the theta cycle of a weight $k <…

This is an exposition, for pedagogical purposes, of the formal power series proof of Bostan, Christol and Dumas [3] of the result stated in the title (a corollary of the Christol theorem).

Let $p>3$ be a prime and $m,n\in\Bbb Z$ with $p\nmid mn$. Built on the work of Morton, in the paper we prove the uniform congruence: $$&\sum_{x=0}^{p-1}\Big(\frac{x^3+mx+n}p\Big) \equiv {-(-3m)^{\frac{p-1}4} \sum_{k=0}^{p-1}\binom{-\frac…

The QCD at finite density is not well understood yet, where standard Monte Carlo simulation suffers from the sign problem. In order to overcome the sign problem, the method of Lefschetz thimble has been explored. Basically, the original…

In 1984, Deligne proved that for any prime number $p$, the reduction modulo $p$ of the diagonal of a multivariate algebraic power series with integer coefficients is algebraic over the field of rational functions with coefficients in…

In this paper we introduce the concept of an infinite loop mod $n$ and discuss the properties that these objects have. In particular, we show that a real number $\alpha$ is a counterexample to the $p$-adic Littlewood Conjecture if and only…

This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros…

The main purpose of this paper is to find all the prime numbers p for which whenever we add to p an odd square less than p we obtain a number which has at most two different prime factors. We solve completely the cases $p\equiv 1,3,5 \pmod…

Non-periodic tilings of $\mathbb{Z}_N$ are a difficult to obtain key to a wide range of complex mathematical issues. In a musician's eyes, they are called rhythmic Vuza canons. After a short summary of the main properties of rhythmic tiling…

The aim of this article is to promote the use of probabilistic methods in the study of problems in mathematical general relativity. Two new and simple singularity theorems, whose features are different from the classical singularity…

We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial.…

In problem solving, understanding the problem that one seeks to solve is an essential initial step. In this paper, we propose computational methods for facilitating problem understanding through the task of recognizing the unknown in…

In this note I give a positive solution to Bullett's conjecture (posed in [1]) regarding a geometric presentation of the universal mod $p$ oriented ring spectrum.

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

The classical Melan equation modeling suspension bridges is considered. We first study the explicit expression and the uniform positivity of the analytical solution for the simplified ``less stiff'' model, based on which we develop a…

We survey the classical results on the prime number theorem

In this short expository article, we describe a mathematical tool called the probabilistic method, and illustrate its elegance and beauty through proving a few well-known results. Particularly, we give an unconventional probabilistic proof…

Since the mathematicians of ancient Greece until Fermat, since Gauss until today; the way how the primes along the numerical straight line are distributed has become perhaps the most difficult math problem; many people believe that their…