English
Related papers

Related papers: On some open problems concerning perfect powers

200 papers

Let $\Gamma$ be the unit circle, $A(\Gamma)$ the Wiener algebra of continuous functions whose series of Fourier coefficients are absolutely convergent, and $A^+$ the subalgebra of $A(\Gamma)$ of functions whose negative coefficients are…

Functional Analysis · Mathematics 2016-09-06 Jean Esterle , Elizabeth Strouse , Fouad Zouakia

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

Number Theory · Mathematics 2025-08-29 Omkar Baraskar , Ingrid Vukusic

Using completely elementary methods, we find all powers of 3 that can be written as the sum of at most twenty-two distinct powers of 2, as well as all powers of 2 that can be written as the sum of at most twenty-five distinct powers of 3.…

Number Theory · Mathematics 2023-07-04 Vassil S. Dimitrov , Everett W. Howe

Let $u_n$ be a nondegenerate Lucas sequence. We generalize the results of Bugeaud, Mignotte, and Siksek, 2006 to give a systematic approach towards the problem of determining all perfect powers in any particular Lucas sequence. We then…

Number Theory · Mathematics 2013-07-25 Jesse Silliman , Isabel Vogt

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

Number Theory · Mathematics 2017-07-11 Doyon Kim

Euler showed that if an odd perfect number $N$ exists, it must consist of two parts $N=q^k n^2$, with $q$ prime, $q \equiv k \equiv 1 \pmod{4}$, and gcd$(q,n)=1$. Dris conjectured that $q^k < n$. We first show that $q<n$ for all odd perfect…

Number Theory · Mathematics 2016-02-05 Patrick Brown

This paper focuses on the study of the order of power series that are linear combinations of a given finite set of power series. The order of a formal power series, known as $\textrm{ord}(f)$, is defined as the minimum exponent of $x$ that…

Computational Complexity · Computer Science 2023-04-27 Louis Gaillard , Gorav Jindal

It was asked by E. Szemer\'edi if, for a finite set $A\subset\mathbb{Z}$, one can improve estimates for $\max\{|A+A|,|A\cdot A|\}$, under the constraint that all integers involved have a bounded number of prime factors -- that is, each…

Number Theory · Mathematics 2025-07-02 Brandon Hanson , Misha Rudnev , Ilya Shkredov , Dmitrii Zhelezov

We show that the number of positive integers $n\leq N$ such that $\mathbb{Z}/(n^2+n+1)\mathbb{Z}$ contains a perfect difference set is asymptotically $N/\log{N}$.

Number Theory · Mathematics 2023-01-09 Sarah Peluse

Considering the problem of finding all the integer solutions of the sum of $M$ consecutive integer squares starting at $a^{2}$ being equal to a squared integer $s^{2}$, it is shown that this problem has no solutions if $M\equiv3,5,6,7,8$ or…

Number Theory · Mathematics 2014-09-30 Vladimir Pletser

In recent years there has been considerable interest in theories over string equations, length function, and string-number conversion predicate within the formal verification, software engineering, and security communities. SMT solvers for…

Logic in Computer Science · Computer Science 2016-10-28 Vijay Ganesh , Murphy Berzish

We show that the perfect Euler brick (perfect cuboid) problem is equivalent to the following elementary question: do there exist coprime integers $a, b, m, n$ such that the two expressions $(2(a^2-b^2)mn)^2 + ((a^2+b^2)(m^2-n^2))^2$ and…

Number Theory · Mathematics 2026-04-13 René Peschmann

For given coprime positive integers $a$ and $b$, the classical Frobenius coin problem asked to find the largest number that cannot be expressed in the form $ax+by$ for nonnegative integers $x$ and $y$, also known as the Frobenius number.…

Number Theory · Mathematics 2021-10-05 Damanvir Singh Binner

We show that there are infinitely many triples of positive integers a, b, c (greater than 1) such that ab + 1, ac + 1, bc + 1 and abc + 1 are all perfect squares.

Number Theory · Mathematics 2025-06-18 Andrej Dujella , László Szalay

Let p be an odd prime, n an odd positive integer and C the p-Sylow subgroup the class group of the p-cyclotomic extension of the rationals. When log(p) is bigger than n**(224n**4), we prove that the eigenspace on C attached to the (p-n)-th…

Number Theory · Mathematics 2007-05-23 Christophe Soulé

Richomme asked the following question: what is the infimum of the real numbers $\alpha$ > 2 such that there exists an infinite word that avoids $\alpha$-powers but contains arbitrarily large squares beginning at every position? We resolve…

Combinatorics · Mathematics 2009-04-14 James D. Currie , Narad Rampersad

If you want to fill $n \in \mathbb{N}$ seats in succession with $n$ people and the rule that each person chooses one of the seats with the maximum distance to an occupied seat, then you can ask yourself how many possibilities there are for…

Combinatorics · Mathematics 2023-04-03 Simon Wundling

In 1948, Erd\"{o}s and Straus formulated a conjecture : for any positive integer $n>2$, there exist positive integers $n_1,n_2$ and $n_3$ such that…

Number Theory · Mathematics 2026-05-25 Xiaoping Xu

A perfect tensor of order $d$ is a state of four $d$-level systems that is maximally entangled under any bipartition. These objects have attracted considerable attention in quantum information and many-body theory. Perfect tensors…

Quantum Physics · Physics 2025-06-23 David Gross , Paulina Goedicke

Let F(n) be a polynomial of degree at least 2 with integer coefficients. We consider the products N_x=\prod_{1 \le n \le x} F(n) and show that N_x should only rarely be a perfect power. In particular, the number of x \le X for which N_x is…

Number Theory · Mathematics 2011-07-12 Paul Spiegelhalter , Joseph Vandehey