SearcharxivSearch

arXiv subjects

Vandita Patel

Publications and source records attributed to Vandita Patel.

16 recordsLinked to original sources

On a character-twisted analogue of Schäffer's equation

Let $f$ be a positive integer, and let $χ$ be a primitive quadratic character of conductor $f$. Let $k$ be a positive integer, and write $B_k(χ,X)$ for the $k$-th Bernoulli polynomial corresponding to $χ$. Suppose $B_k(χ,X)$ is irreducible and of degree at least $2$. Then for 100% of positive integers $m$ divisible by $f$, the Diophantine equation \[ χ(1) \cdot (x+1)^k+χ(2) \cdot (x+2)^k+\cdots+χ(m) \cdot (x+m)^k \, =\, y^n, \] has no solutions with $x$, $y$, $n$ integers, and $n \ge 2$.

math.NT

On perfect powers that are sums of cubes of a nine term arithmetic progression

We study the equation $(x-4r)^3 + (x-3r)^3 + (x-2r)^3+(x-r)^3 + x^3 + (x+r)^3+(x+2r)^3 + (x+3r)^3 + (x+4r)^3 = y^p$, which is a natural continuation of previous works carried out by A. Argáez-García and the fourth author (perfect powers that are sums of cubes of a three, five and seven term arithmetic progression). Under the assumptions $0 < r \leq 10^6$, $p \geq 5 $ a prime and $\gcd(x, r) = 1$, we show that solutions must satisfy $xy=0$. Moreover, we study the equation for prime exponents $2$ and $3$ in greater detail. Under the assumptions $r>0$ a positive integer and $\gcd(x, r) = 1$ we show that there are infinitely many solutions for $p=2$ and $p=3$ via explicit constructions using integral points on elliptic curves. We use an amalgamation of methods in computational and algebraic number theory to overcome the increased computational challenge. Most notable is a significant computational efficiency obtained through appealing to Bilu, Hanrot and Voutier's Primitive Divisor Theorem and the method of Chabauty, as well as employing a Thue equation solver earlier on.

math.NT

Power values of power sums: a survey

Research on power values of power sums has gained much attention of late, partially due to the explosion of refinements in multiple advanced tools in (computational) Number Theory in recent years. In this survey, we present the key tools and techniques employed thus far in the (explicit) resolution of Diophantine problems, as well as an overview of existing results. We also state some open problems that naturally arise in the process.

math.NT

Odd values of the Ramanujan tau function

We prove a number of results regarding odd values of the Ramanujan $τ$-function. For example, we prove the existence of an effectively computable positive constant $κ$ such that if $τ(n)$ is odd and $n \ge 25$ then either \[ P(τ(n)) \; > \; κ\cdot \frac{\log\log\log{n}}{\log\log\log\log{n}} \] or there exists a prime $p \mid n$ with $τ(p)=0$. Here $P(m)$ denotes the largest prime factor of $m$. We also solve the equation $τ(n)=\pm 3^{b_1} 5^{b_2} 7^{b_3} 11^{b_4}$ and the equations $τ(n)=\pm q^b$ where $3\le q < 100$ is prime and the exponents are arbitrary nonnegative integers. We make use of a variety of methods, including the Primitive Divisor Theorem of Bilu, Hanrot and Voutier, bounds for solutions to Thue--Mahler equations due to Bugeaud and Győry, and the modular approach via Galois representations of Frey-Hellegouarch elliptic curves.

math.NT

Perfect Powers that are Sums of Squares of an Arithmetic Progression

In this paper, we determine all primitive solutions to the equation $(x+r)^2 +(x+2r)^2 +\cdots +(x+dr)^2 = y^n$ for $2\leq d\leq 10$ and for $1\leq r\leq 10^4$. We make use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.

math.NT

A Lucas-Lehmer approach to generalised Lebesgue-Ramanujan-Nagell equations

We describe a computationally efficient approach to resolving equations of the form $C_1x^2 + C_2 = y^n$ in coprime integers, for fixed values of $C_1$, $C_2$ subject to further conditions. We make use of a factorisation argument and the Primitive Divisor Theorem due to Bilu, Hanrot and Voutier.

math.NT

On perfect powers that are sums of cubes of a seven term arithmetic progression

We prove that the equation $(x-3r)^3+(x-2r)^3 + (x-r)^3 + x^3 + (x+r)^3 + (x+2r)^3+(x+3r)^3= y^p$ only has solutions which satisfy $xy=0$ for $1\leq r\leq 10^6$ and $p\geq 5$ prime. This article complements the work on the equations $(x-r)^3 + x^3 + (x+r)^3 = y^p$ and $(x-2r)^3 + (x-r)^3 + x^3 + (x+r)^3 + (x+2r)^3= y^p$ . The methodology in this paper makes use of the Primitive Divisor Theorem due to Bilu, Hanrot and Voutier for a complete resolution of the Diophantine equation.

math.NT

Shifted powers in Lucas-Lehmer sequences

We develop a general framework for finding all perfect powers in sequences derived by shifting non-degenerate quadratic Lucas-Lehmer binary recurrence sequences by a fixed integer. By combining this setup with bounds for linear forms in logarithms and results based upon the modularity of elliptic curves defined over totally real fields, we are able to answer a question of Bugeaud, Luca, Mignotte and the third author by explicitly finding all perfect powers of the shape $F_k \pm 2 $ where $F_k$ is the $k$-th term in the Fibonacci sequence.

math.NT

On perfect powers that are sums of cubes of a three term arithmetic progression

Using only elementary arguments, Cassels and Uchiyama (independently) determined all squares that are sums of three consecutive cubes. Zhongfeng Zhang extended this result and determined all perfect powers that are sums of three consecutive cubes. Recently, the equation $(x-r)^k + x^k + (x+r)^k$ has been studied for $k=4$ by Zhongfeng Zhang and for $k=2$ by Koutsianas. In this paper, we complement the work of Cassels, Koutsianas and Zhang by considering the case when $k=3$ and showing that the equation $(x-r)^3+x^3+(x+r)^3=y^n$ with $n\geq 5$ a prime and $0 < r \leq 10^6$ only has trivial solutions $(x,y,n)$ which satisfy $xy=0$.

math.NT

On the difference between permutation polynomials over finite fields

The well-known Chowla and Zassenhaus conjecture, proven by Cohen in 1990, states that if $p>(d^2-3d+4)^2$, then there is no complete mapping polynomial $f$ in $\Fp[x]$ of degree $d\ge 2$. For arbitrary finite fields $\Fq$, a similar non-existence result is obtained recently by I\c sık, Topuzo\u glu and Winterhof in terms of the Carlitz rank of $f$. Cohen, Mullen and Shiue generalized the Chowla-Zassenhaus-Cohen Theorem significantly in 1995, by considering differences of permutation polynomials. More precisely, they showed that if $f$ and $f+g$ are both permutation polynomials of degree $d\ge 2$ over $\Fp$, with $p>(d^2-3d+4)^2$, then the degree $k$ of $g$ satisfies $k \geq 3d/5$, unless $g$ is constant. In this article, assuming $f$ and $f+g$ are permutation polynomials in $\Fq[x]$, we give lower bounds for $k %=\mathrm{deg(h)} $ in terms of the Carlitz rank of $f$ and $q$. Our results generalize the above mentioned result of I\c sık et al. We also show for a special class of polynomials $f$ of Carlitz rank $n \geq 1$ that if $f+x^k$ is a permutation of $\Fq$, with $\gcd(k+1, q-1)=1$, then $k\geq (q-n)/(n+3)$.

math.AG

Perfect powers that are sums of consecutive cubes

Euler noted the relation $6^3=3^3+4^3+5^3$ and asked for other instances of cubes that are sums of consecutive cubes. Similar problems have been studied by Cunningham, Catalan, Gennochi, Lucas, Pagliani, Cassels, Uchiyama, Stroeker and Zhongfeng Zhang. In particular Stroeker determined all squares that can be written as a sum of at most $50$ consecutive cubes. We generalize Stroeker's work by determining all perfect powers that are sums of at most $50$ consecutive cubes. Our methods include descent, linear forms in two logarithms, and Frey-Hellegouarch curves.

math.NT

On powers that are sums of consecutive like powers

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 solutions.

math.NT

Superelliptic equations arising from sums of consecutive powers

Using only elementary arguments, Cassels solved the Diophantine equation $(x-1)^3+x^3+(x+1)^3=z^2$ in integers $x$, $z$. The generalization $(x-1)^k+x^k+(x+1)^k=z^n$ (with $x$, $z$, $n$ integers and $n \ge 2$) was considered by Zhongfeng Zhang who solved it for $k=2$, $3$, $4$ using Frey-Hellegouarch curves and their Galois representations. In this paper, by employing some sophisticated refinements of this approach, we show that the only solution for $k=5$ is $x=z=0$, and that there are no solutions for $k=6$. The chief innovation we employ is a computational one, which enables us to avoid the full computation of data about cuspidal newforms of high level.

math.NT