Related papers: The congruence speed formula
We consider in this paper the problem of computing the entropy of a braid. We recall its definition and construct, for each braid, a sequence of real numbers, whose limit is its entropy. We state one conjecture about the convergence speed,…
We examine the relative performance of algorithms for the calculation of curvature in spacetime. The classical coordinate component method is compared to two distinct versions of the Newman-Penrose tetrad approach for a variety of…
In his 2003 paper, Varadhan proves the averaged large deviation principle for the mean velocity of a particle taking a nearest-neighbor random walk in a uniformly elliptic i.i.d. environment on $\mathbb{Z}^d$ with $d\geq1$, and gives a…
It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…
In this paper, we study a density version of the Waring-Goldbach problem. Suppose that A is a subset of the primes, and the lower density of A in the primes is larger than 1-1/2k. We prove that every sufficiently large natural number n…
The assembly index of assembly theory quantifies the minimal number of composition steps required to construct an object from elementary components. The study proves that the decision version of the assembly index problem is NP-complete,…
In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…
A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…
In this paper we present the experimental results that more clearly than any theory suggest an answer to the question: when in detection of large (probably) prime numbers to apply, a very resource demanding, Miller-Rabin algorithm. Or, to…
We construct an increasing sequence of natural numbers $(m_n)_{n=1}^{+\infty}$ with the property that $(m_n \th [1])_{n\geq 1}$ is dense in $\T$ for any $\th \in \R\setminus \Q$, and a continuous measure on the circle $\mu$ such that…
In this paper we attack the Erdos-Straus conjecture by means of the structure of its solutions, extending and improving the results of a previous paper. Using previous results and supported by the works of Elsholtz and Tao and Monks and…
We show that every Sturmian word has the property that the distance between consecutive ending positions of cubes occurring in the word is always bounded by $10$ and this bound is optimal, extending a result of Rampersad, who proved that…
In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence $a_1x_1+\cdots +a_kx_k\equiv b \pmod{n}$, with…
We develop a general approach of the almost sure central limit theorem for the quasi-continuous vectorial martingales and we release a quadratic extension of this theorem while specifying speeds of convergence. As an application of this…
We consider a scalar parabolic equation in one spatial dimension. The equation is constituted by a convective term, a reaction term with one or two equilibria, and a positive diffusivity which can however vanish. We prove the existence and…
We establish the rate of convergence in the strong law of large numbers of discrete Fourier Transform of the identically distributed random variables with finite moment of order p, where 1<p<2.
The speed of a class of graphs counts the number of graphs on the vertex set $\lbrace 1,\dots, n\rbrace$ inside the class as a function of $n$. In this paper, we investigate this function for many classes of graphs that naturally arise in…
A sharp asymptotic formula for the sum of reciprocals of $\pi(n)$ is derived, where $\pi(x)$ is the number of primes not exceeding $x$. This result improves the previous results of De Koninck--Ivi\'c and L. Panaitopol.
In this paper, we study some supercongruences involving the sequence $$ t_n(x)=\sum_{k=0}^n\binom{n}{k}\binom{x}{k}\binom{x+k}{k}2^k $$ and solve some open problems. For any odd prime $p$ and $p$-adic integer $x$, we determine…
Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…