相关论文: Second numbers in arithmetic progressions
In the present work the existence of some patterns of primes is shown which generalize the celebrated result of Green and Tao according to which there are arbitrarily long arithmetic progressions in the sequence of primes
We establish new upper bounds for the length of runs of consecutive positive integers each with exactly $k$ divisors, where $k$ is a given positive integer of some special forms. Also we have found exact values of the maximum possible runs…
Euler showed that there can be no more than three integer squares in arithmetic progression. In quadratic number fields, Xarles has shown that there can be arithmetic progressions of five squares, but not of six. Here, we prove that there…
Recently, Harrington, Litman, and Wong [Bulletin of the Australian Mathematical Society, 2024; arXiv:2303.06534] proved that every arithmetic progression contains infinitely many base-$b$ Niven numbers, for any fixed $b\ge 2$. We use a…
In this note we are interested in the problem of whether or not every increasing sequence of positive integers $x_1x_2x_3...$ with bounded gaps must contain a double 3-term arithmetic progression, i.e., three terms $x_i$, $x_j$, and $x_k$…
Recently uncovered second derivative discontinuous solutions of the simplest linear ordinary differential equation define not only an nonstandard extension of the framework of the ordinary calculus, but also provide a dynamical…
The first two authors have shown [KK99,KK00] that the sum the exponent (and thus the number) of maximal repetitions of exponent at least 2 (also called runs) is linear in the length of the word. The exponent 2 in the definition of a run may…
We give an algorithm to compute the series expansion for the inverse of a given function. The algorithm is extremely easy to implement and gives the first $N$ terms of the series. We show several examples of its application in calculating…
We investigate integer numbers which possess at the same time the properties to be triangulars and squares, that are, numbers $a$ for which do exist integers $m$ and $n$ such that $ a = n^2 = \frac{m \cdot (m+1)}{2} $. In particular, we are…
In this paper we establish properties of independence for the continued fraction expansions of two algebraic numbers. Roughly speaking, if the continued fraction expansions of two irrational algebraic numbers have the same long sub-word,…
In this paper we improve the estimate for the remainder term in the asymptotic formula concerning the circle problem in an arithmetic progression.
The numerical radius of the general $2\times2$ complex matrix is calculated.
Given two infinite sequences with known binomial transforms, we compute the binomial transform of the product sequence. Various identities are obtained and numerous examples are given involving sequences of special numbers: Harmonic…
This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
We show that the exponent of distribution of the sequence of squarefree numbers in arithmetic progressions of prime modulus is $\geq 2/3 + 1/57$, improving a result of Prachar from 1958. Our main tool is an upper bound for certain bilinear…
We introduce a class of stochastic integer sequences. In these sequences, every element is a sum of two previous elements, at least one of which is chosen randomly. The interplay between randomness and memory underlying these sequences…
We give an equivalent form of the Twin prime conjecture relating to a symmetric property that is observed for terms present in a certain sequence of arithmetic progressions defined for a pair of co-prime integers.
We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.
We show that there exists an upper bound for the number of squares in arithmetic progression over a number field that depends only on the degree of the field. We show that this bound is 5 for quadratic fields, and also that the result…