Related papers: First occurrences of square-free gaps and an algor…
We study "dead ends" in square-free digit walks: square-free integers $N$ such that, in base $b$, every one-digit extension $bN+d$ is non-square-free. In base $10$, the stochastic independence model of Miller et al. suggests that infinite…
In this paper we show that there exist infinitely many square-free numbers of the form $n^2+n+1$. We achieve this by deriving an asymptotic formula by improving the reminder term from previous results.
We have devised an alternative approach to sifting integers in the sieve of Eratosthenes that helps refine the error term. Instead of eliminating all multiples of a prime number $p<z$ in the traditional sieve method, our approach solely…
The Three Gap Theorem states that there are at most three distinct lengths of gaps if one places $n$ points on a circle, at angles of $z, 2z, 3z, \ldots nz$ from the starting point. The theorem was first proven in 1958 by S\'os and many…
The width $\triangle_L$ of the first Bragg's scattering peak in the (111) direction of a face-centered-cubic lattice of air spheres can be well approximated by a simple formula which only involves the volume averaged $\epsilon$ and…
Let P and Q be non-zero integers. The Lucas sequence U_n(P,Q), n=0,1,2,... is defined by U_0=0, U_1=1, U_n= P U_{n-1}-Q U_{n-2} for n>1. For each positive integer n<8 we describe all Lucas sequences with (P,Q)=1 having the property that…
We study the role of perfect completeness in probabilistically checkable proof systems (PCPs) and give a new way to transform a PCP with imperfect completeness to a PCP with perfect completeness when the initial gap is a constant. In…
Arithmetical structures on graphs were first introduced in \cite{Lorenzini89}. Later in \cite{arithmetical} they were further studied in the setting of square non-negative integer matrices. In both cases, necessary and sufficient conditions…
We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes $p$ in a dyadic interval $[Q,2Q]$ for which a given interval $[u+1,u+\psi(Q)]$ does not contain a quadratic non-residue modulo $p$. The bound…
Slattery (2007) described computational methods to enumerate, construct, and identify finite groups of squarefree order. We generalise Slattery's result to the class of finite groups that have cyclic Sylow subgroups and provide an…
Two latin squares are orthogonal if, when they are superimposed, every ordered pair of symbols appears exactly once. This definition extends naturally to `incomplete' latin squares each having a hole on the same rows, columns, and symbols.…
This paper discusses the B{\"o}hm-Vitense gap, a gap in the colours of stars that occurs when the atmosphere changes from radiative to convective in deep layers. We are using different algorithms for detecting gaps in colour-magnitude…
An exponent of distribution 1/16 is established for square-free palindromes. The main input is an upper bound for the number of palindromes, in arithmetic progressions to large moduli, divisible by large squares. Our argument combines a…
We discuss questions related to the non-existence of gaps in the series defining modular forms and other arithmetic functions of various types, and improve results of Serre, Balog and Ono, and Alkan, using new results about exponential sums…
For each prime $p$, let $I_p \subset \mathbb{Z}/p\mathbb{Z}$ denote a collection of residue classes modulo $p$ such that the cardinalities $|I_p|$ are bounded and about $1$ on average. We show that for sufficiently large $x$, the sifted set…
This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result…
Various authors, including McNew, Nathanson and O'Bryant, have recently studied the maximal asymptotic density of a geometric progression free sequence of positive integers. In this paper we prove the existence of geometric progression free…
We propose the formula for the number of pairs of consecutive primes $p_n, p_{n+1}<x$ separated by gap $d=p_{n+1}-p_n$ expressed directly by the number of all primes $<x$, i.e. by $\pi(x)$. As the application of this formula we formulate 7…
The aim of this paper is to study the spectral gap and the logarithmic Sobolev constant for continuous spin systems. A simple but general result for estimating the spectral gap of finite dimensional systems is given by Theorem 1.1, in terms…
The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…