English
Related papers

Related papers: An unexpected meeting between the $P^{3}_{1}$-set …

200 papers

This paper is concerned with the problem of expressing three consecutive integers as sums of three cubes. We give several parametric solutions of the problem. We also give somewhat trivial solutions of five or seven consecutive integers…

Number Theory · Mathematics 2023-11-30 Ajai Choudhry

In this paper, we refine the method introduced by Izadi and Baghalaghdam to search integer solutions to the Diophantine equation $X_1^5+X_2^5+X_3^5=Y_1^3+Y_2^3+Y_3^3$. We show that the Diophantine equation has infinitely many positive…

Number Theory · Mathematics 2019-06-25 Gaku Iokibe

For $p$ and $q$ any two distinct Fermat or Mersenne primes, $m,n,r$ as positive integers and $\mu = \pm 1$ satisfying any diophantine relation, $\mbox{(i)}\; 2^m + \mu = p^nq^r, \mbox{(ii)} \; 2^mp^n + \mu = q^r \mbox{ or } \mbox{(iii)} \;…

Number Theory · Mathematics 2025-11-27 Anupam Saxena

Let $F_n$ be the $n$-th Fibonacci number. In this paper, we study the Diophantine equation $F_n+F_m=p^xq^y$ in nonnegative integers $n\ge m$, $x$ and $y$, where $p$ and $q$ are fixed distinct prime numbers. We determine all pairs of primes…

Number Theory · Mathematics 2026-02-23 Herbert Batte , Florian Luca , Volker Ziegler

The subject matter of this work is the diophantine equation x^n+y^m=c(x^k)(y^l), where n,m,k,l,c are natural numbers.We investigate this equation from the point of view of positive integer solutions.A preliminary examination of sources such…

Number Theory · Mathematics 2010-06-10 Konstantine Zelator

Let $k \geq 3$. If a multiplicative function $f$ satisfies \[ f(a_1^3 + a_2^3 + \cdots + a_k^3) = f(a_1^3) + f(a_2^3) + \cdots + f(a_k^3) \] for all $a_1, a_2, \ldots, a_k \in \mathbb{N}$, then $f$ is the identity function. The set of…

Number Theory · Mathematics 2023-02-16 Poo-Sung Park

For each integer $m\ge3$, let $P_m(x)$ denote the generalized $m$-gonal number $\frac{(m-2)x^2-(m-4)x}{2}$ with $x\in\mathbb{Z}$. Given positive integers $a,b,c,k$ and an odd prime number $p$ with $p\nmid c$, we employ the theory of ternary…

Number Theory · Mathematics 2020-07-21 Hai-Liang Wu

Crux Mathematicorum with Mathematical Mayhem, is a problem solving journal published by the Canadian Mathematical Society. In the March 2010 issue(see reference[1]) ,the following problem was proposed:Determine all positive integers a,b,…

General Mathematics · Mathematics 2011-12-19 Konstantine Zelator

For a set $A$ of positive integers with $\gcd(A)=1$, let $\langle A \rangle$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. Then it is well known that only finitely many positive integers…

Number Theory · Mathematics 2025-07-02 Ryan Azim Shaikh , Amitabha Tripathi

Let $F_n$ denote the $n$-th Fibonacci number and $L_n$ the $n$-th Lucas number. We completely solve the family of cubic Thue equations $${(X-F_nY)(X-L_nY)X-Y^3=\pm1}$$ and show that there are no non-trivial solutions for $n\neq 1,3$.

Number Theory · Mathematics 2021-06-08 Tobias Hilgart , Ingrid Vukusic , Volker Ziegler

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is…

Formal Languages and Automata Theory · Computer Science 2009-07-06 M. Rigo , L. Waxweiler

It was discovered some years ago that there exist non-integer real numbers $q>1$ for which only one sequence $(c_i)$ of integers $c_i \in [0,q)$ satisfies the equality $\sum_{i=1}^\infty c_iq^{-i}=1$. The set of such "univoque numbers" has…

Number Theory · Mathematics 2008-12-18 Martijn de Vries , Vilmos Komornik

Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…

Optimization and Control · Mathematics 2013-01-10 Amitabh Basu , Robert Hildebrand , Matthias Köppe

Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…

Number Theory · Mathematics 2024-10-29 Gergő Batta , Lajos Hajdu , András Pongrácz

Consider the interval of integers $I_{m,n} = \{m, m+1, m+2,\ldots, m+n-1 \}$. For fixed integers $h,k,m$, and $c$, let $\Phi_{h,k,m}^{(c)}(n)$ denote the number of solutions of the equation $(a_1+\cdots + a_h)- (a_{h+1} + \cdots +…

Number Theory · Mathematics 2020-04-17 Melvyn B. Nathanson

A repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number has the form $d(10^m-1)/9$ for some $m\geq 1$ and $1 \leq d \leq 9$. Let $\left(T_n\right)_{n\ge0}$ be the sequence of Tribonacci.…

Number Theory · Mathematics 2025-09-12 Pranabesh Das , Salah Eddine Rihane , Alain Togbé

Let $m\geq -1$ be an integer. We give a correspondence between integer solutions to the parametric family of cubic Thue equations \[ X^3-mX^2Y-(m+3)XY^2-Y^3=\lambda \] where $\lambda>0$ is a divisor of $m^2+3m+9$ and isomorphism classes of…

Number Theory · Mathematics 2011-07-14 Akinari Hoshi

In this article we explicitly describe irreducible trinomials X^3-aX+b which gives all the cyclic cubic extensions of Q. In doing so, we construct all integral points (x,y,z) with GCD(y,z)=1, of the curves X^2+3Y^2 = 4DZ^3 and…

Number Theory · Mathematics 2022-12-01 Dipramit Majumdar , B. Sury

Let $g\ge 2$ be an integer and $\mathcal R_g\subset \mathbb N$ be the set of repdigits in base $g$. Let $\mathcal D_g$ be the set of Diophantine triples with values in $\mathcal R_g$; that is, $\mathcal D_g$ is the set of all triples…

Number Theory · Mathematics 2015-08-31 Attila Bérczes , Florian Luca , István Pink , Volker Ziegler

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…

Number Theory · Mathematics 2007-05-23 Thomas Garrity