Related papers: Arithmetic progressions of squares, cubes and $n$-…

We show that any proper symmetric two dimensional arithmetic progression contained in the interval $[-T,T]$ which avoids non-zero perfect squares has at most $O_\varepsilon(T^{20/27+\varepsilon})$ elements. This improves on a result of…

We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

Congruences of truncated sums of infinite series do not directly extend to congruences of the truncated sums of higher powers of these infinite series. Guo and Zudilin recently established a variety of supercongruences for truncated sums of…

In this paper, it is proved that there is an arithmetic progression of positive integers such that each of which is expressible neither as $p+F_m$ nor as $q+L_n$, where $ p,q $ are primes, $ F_m $ denotes the $ m $-th Fibonacci number and $…

We establish that, for almost all natural numbers $N$, there is a sum of two positive integral cubes lying in the interval $[N-N^{7/18+\epsilon},N]$. Here, the exponent $7/18$ lies half way between the trivial exponent $4/9$ stemming from…

We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

We give the q-analogue of the sums of the n-th powers of positive integers up to k-1.

In this paper upper bounds are given for the successive differences $A_{n+1}-A_{n}$ and B$_{n}-B_{n-1}$ where $A_{n}=1/(n-1) \tsum_{r=1}^{n-1}f(r/n)$, $B_{n}=1/(n+1) \tsum_{r=0}^{n}f(r/n)$ and $f$ is superquadratic function. We obtain…

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. The main result is twofold: (1) we give the explicit expressions of the numbers of distinct squares and cubes in $\mathbb{T}[1,n]$ (the…

We solve the enumeration of the set $\textrm{AP}(n)$ of partitions of a positive integer $n$ in which the nondecreasing sequence of parts forms an arithmetic progression. In particular, we establish a formula for the number of nondecreasing…

We prove the lower bound for the number of Lucas non-Wieferich primes in arithmetic progressions. More precisely, for any given integer $k\geq 2$ there are $\gg \log x$ Lucas non-Wieferich primes $p\leq x$ such that $p\equiv\pm1\pmod{k}$,…

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

In this paper, we improve the error term in a previous paper on an asymptotic formula for the number of squarefull numbers in an arithmetic progression.

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

A power is a word of the form $\underbrace{uu...u}_{k \; \text{times}}$, where $u$ is a word and $k$ is a positive integer and a square is a word of the form $uu$. Fraenkel and Simpson conjectured in 1998 that the number of distinct squares…

Keating and Rudnick derived asymptotic formulas for the variances of primes in arithmetic progressions and short intervals in the function field setting. Here we consider the hybrid problem of calculating the variance of primes in…