English
Related papers

Related papers: Arithmetic progressions consisting of unlike power…

200 papers

In a previous paper of the authors, we showed that for any polynomials $P_1,\dots,P_k \in \Z[\mathbf{m}]$ with $P_1(0)=\dots=P_k(0)$ and any subset $A$ of the primes in $[N] = \{1,\dots,N\}$ of relative density at least $\delta>0$, one can…

Number Theory · Mathematics 2014-10-13 Terence Tao , Tamar Ziegler

Progression, the task of updating a knowledge base to reflect action effects, generally requires second-order logic. Identifying first-order special cases, by restricting either the knowledge base or action effects, has long been a central…

Artificial Intelligence · Computer Science 2026-05-14 Jens Classen , Daxin Liu

We obtain an asymptotic formula for the average value of the divisor function over the integers $n \le x$ in an arithmetic progression $n \equiv a \pmod q$, where $q=p^k$ for a prime $p\ge 3$ and a sufficiently large integer $k$. In…

Number Theory · Mathematics 2016-02-12 Kui Liu , Igor E. Shparlinski , Tianping Zhang

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

Number Theory · Mathematics 2017-07-24 Acquaah Peter

An arithmetic progression is a sequence of integers in which the difference between any two consecutive elements is the same. We investigate the parameterized complexity of two problems related to arithmetic progressions, called Cover by…

Computational Complexity · Computer Science 2023-12-12 Ivan Bliznets , Jesper Nederlof , Krisztina Szilágyi

We fix a non-zero integer $a$ and consider arithmetic progressions $a \bmod q$, with $q$ varying over a given range. We show that for certain specific values of $a$, the arithmetic progressions $a \bmod q$ contain, on average, significantly…

Number Theory · Mathematics 2019-12-19 Daniel Fiorilli

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Grégoire Lecerf , Éric Schost

Let $\mu$ be the M\"{o}bius function and let $k \geq 1$. We prove that the Gowers $U^k$-norm of $\mu$ restricted to progressions $\{n \leq X: n\equiv a_q\pmod{q}\}$ is $o(1)$ on average over $q\leq X^{1/2-\sigma}$ for any $\sigma > 0$,…

Number Theory · Mathematics 2017-06-28 Xuancheng Shao

Let Q(N;q,a) denotes the number of squares in the arithmetic progression qn+a, for n=0, 1,...,N-1, and let Q(N) be the maximum of Q(N;q,a) over all non-trivial arithmetic progressions qn + a. Rudin's conjecture asserts that Q(N)=O(Sqrt(N)),…

Number Theory · Mathematics 2014-11-12 Enrique González-Jiménez , Xavier Xarles

Dirichlet's proof of infinitely many primes in arithmetic progressions was published in 1837, introduced L-series for the first time, and it is said to have started rigorous analytic number theory. Dirichlet uses Euler's earlier work on the…

History and Overview · Mathematics 2014-11-25 Peter Gustav Lejeune Dirichlet

For every $n = 2^k > 8$ there exist exactly $[(k+1)/2]$ mutually nonequivalent $Z_4$-linear extended perfect codes with distance 4. All these codes have different ranks.

Information Theory · Computer Science 2008-05-10 Denis Krotov

We study $\nu_k(n)$, the number of partitions of $n$ into $k$ part sizes, and find numerous arithmetic progressions where $\nu_2$ and $\nu_3$ take on values divisible by 2 and 4. Expanding earlier work, we show $\nu_2(An+B) \equiv 0…

Combinatorics · Mathematics 2016-05-05 William J. Keith

For a Carmichael number $n$ with prime factors $p_1,\cdots,p_m$, define $$K=GCD[p_1-1,\cdots,p_m-1],$$ and let $C_\nu(X)$ denote the number of Carmichael numbers up to $X$ such that $K=\nu$. Assuming a strong conjecture on the first prime…

Number Theory · Mathematics 2024-10-29 Thomas Wright

Let $k \ge 2$ be even, and let $r$ be a non-zero integer. We show that for almost all $d \ge 2$ (in the sense of natural density), the equation $$ x^k+(x+r)^k+\cdots+(x+(d-1)r)^k=y^n, \qquad x,~y,~n \in \mathbb{Z}, \qquad n \ge 2, $$ has no…

Number Theory · Mathematics 2016-07-29 Vandita Patel , Samir Siksek

A sequence of rational points on an algebraic planar curve is said to form an $r$-geometric progression sequence if either the abscissae or the ordinates of these points form a geometric progression sequence with ratio $r$. In this work, we…

Number Theory · Mathematics 2020-10-09 Gamze Savaş Çelik , Mohammad Sadek , Gökhan Soydan

For finite sums of non-negative powers of arithmetic progressions the generating functions (ordinary and exponential ones) for given powers are computed. This leads to a two parameter generalization of Stirling and Eulerian numbers. A…

Number Theory · Mathematics 2017-07-17 Wolfdieter Lang

In this paper, we carry out a fairly comprehensive study of two special classes of numerical semigroups, one generated by the sequence of partial sums of an arithmetic progression and the other one generated by the partial sums of a…

Commutative Algebra · Mathematics 2021-04-26 Sudip Pandit , Joydip Saha , Indranath Sengupta

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

Let $\mathcal{F}=\{A_1,A_2,\ldots,A_k\}$ be a collection of finite arithmetic progressions, where each $A_d$ is an initial segment of the set $D_d=\{d,2d,3d,\ldots\}$ of consecutive multiples of a positive integer $d$. Let $m(\mathcal{F})$…

Combinatorics · Mathematics 2026-03-04 Noga Alon , Michał Dębski , Jarosław Grytczuk , Jakub Przybyło

Fix $k$ a positive integer, and let $\ell$ be coprime to $k$. Let $p(k,\ell)$ denote the smallest prime equivalent to $\ell \pmod{k}$, and set $P(k)$ to be the maximum of all the $p(k,\ell)$. We seek lower bounds for $P(k)$. In particular,…

Number Theory · Mathematics 2016-12-23 Junxian Li , Kyle Pratt , George Shakan