English
Related papers

Related papers: Diophantine equations involving Euler's totient fu…

200 papers

For K \subseteq C, let B_n(K)={(x_1,...,x_n) \in K^n: for each y_1,...,y_n \in K the conjunction (\forall i \in {1,...,n} (x_i=1 => y_i=1)) AND (\forall i,j,k \in {1,...,n} (x_i+x_j=x_k => y_i+y_j=y_k)) AND (\forall i,j,k \in {1,...,n}…

Logic · Mathematics 2012-04-09 Apoloniusz Tyszka

Let $\sigma(n)$ denote the sum of the positive divisors of $n$. We prove that for any positive integer $k$, there is a number $m$ for which the equation $\sigma(x)=m$ has exactly $k$ solutions, settling a conjecture of Sierpi\'nski from…

Number Theory · Mathematics 2019-10-21 Kevin Ford , Sergei Konyagin

In this paper we consider the Diophantine equation $ V_n - b^m = c $ for given integers $ b,c $ with $ b \geq 2 $, whereas $ V_n $ varies among Lucas-Lehmer sequences of the second kind. We prove under some technical conditions that if the…

Number Theory · Mathematics 2025-06-05 Sebastian Heintze , Volker Ziegler

In this paper, we are interested in entire, non-trivial, non-negative solutions and/or entire, positive solutions to the simplest models of polyharmonic equations with power-type nonlinearity \[ \Delta^m u = \pm u^{\alpha} \quad \text{ in }…

Analysis of PDEs · Mathematics 2020-09-28 Quôc Anh Ngô , Van Hoang Nguyen , Quoc Hung Phan , Dong Ye

Given two relatively prime numbers $a$ and $b$, it is known that exactly one of the two Diophantine equations has a nonnegative integral solution $(x,y)$: $$ ax + by \ =\ \frac{(a-1)(b-1)}{2}\quad \mbox{ and }\quad 1 + ax + by \ =\…

Number Theory · Mathematics 2025-09-11 Hung Viet Chu , Rishabh Gulecha , Sicheng Guo , Nathanael Johnson , Steven J. Miller , Yeju Shin

As an application of the method of Thue-Siegel, we will resolve a conjecture of Walsh to the effect that the Diophantine equation $aX^{4} - bY^2=1$, for fixed positive integers $a$ and $b$, possesses at most two solutions in positive…

Number Theory · Mathematics 2009-03-11 Shabnam Akhtari

Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$--generalized Lucas numbers for some fixed integer $k\ge 2$ whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we…

Number Theory · Mathematics 2024-12-18 Herbert Batte , Florian Luca

Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we look at the exponential Diophantine equation $L_n-2^x3^y=c$, for $n,x,y\in \mathbb{Z}_{\ge0}$. We treat the cases $c\in -\mathbb{N}$, $c=0$ and $c\in \mathbb{N}$…

Number Theory · Mathematics 2024-01-15 Herbert Batte , Mahadi Ddamulira , Juma Kasozi , Florian Luca

In the fall 2011 issue of the Journal'Mathematics and Computer Education', author Unal Hasan, in the one page article "Proof without Words", gives a purely geometric proof of the equality, arctan(1/3)+ arctan(1/7) = arctan(1/2) (1) (See…

General Mathematics · Mathematics 2012-03-30 Konstantine Zelator

In this paper we determine possible decompositions of Euler polynomials $E_k(x)$, i.e. possible ways of writing Euler polynomials as a functional composition of polynomials of lower degree. Using this result together with the well-known…

Number Theory · Mathematics 2013-12-16 D. Kreso , Cs. Rakaczki

We study the set D of positive integers d for which the equation $\phi(a)-\phi(b)=d$ has infinitely many solution pairs (a,b), where $\phi$ is Euler's totient function. We show that the minumum of D is at most 154, exhibit a specific A so…

Number Theory · Mathematics 2022-07-05 Kevin Ford , Sergei Konyagin

Let $u_k$ be a Lucas sequence. A standard technique for determining the perfect powers in the sequence $u_k$ combines bounds coming from linear forms in logarithms with local information obtained via Frey curves and modularity. The key to…

Number Theory · Mathematics 2019-02-20 Michael A. Bennett , Sander R. Dahmen , Maurice Mignotte , Samir Siksek

In this paper, we state with a variational method a general theorem providing the existence of a weak solution $u$ for fractional Euler-Lagrange equations of the type: $$ \dfrac{\partial L}{\partial x} (u,D^\alpha_- u,t) + D^\alpha_+…

Dynamical Systems · Mathematics 2016-01-14 Loïc Bourdin

In 2002, F. Luca and G. Walsh solved the Diophantine equation in the title for all pairs (a,b) such that 1<a<b<101 with some exceptions. There are sixty nine exceptions. In this paper, we give some new results concerning the equation in the…

Number Theory · Mathematics 2018-01-16 Refik Keskin

A composite number $n$ is called a Lehmer number when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n$ such that $\phi(n)| n-1$? No such numbers are known.…

Number Theory · Mathematics 2015-10-26 Gholam Reza Pourgholi , Hendrik Van Maldeghem

In this paper, we consider the equation $(a^n-2^{m})(b^n-2^{m})=x^2$. By assuming the abc conjecture is true, in [8], Luca and Walsh gave a theorem, which implies that the above equation has only finitely many solutions $n,x$ if a and b are…

Number Theory · Mathematics 2018-01-16 Zafer Şiar , Refik Keskin

In this paper we consider the Diophantine equation $x^2+q^{2m}=2y^p$ where $m,p,q,x,y$ are integer unknowns with $m>0,$ $p$ and $q$ are odd primes and $\gcd(x,y)=1.$ We prove that there are only finitely many solutions $(m,p,q,x,y)$ for…

Number Theory · Mathematics 2015-06-26 Szabolcs Tengely

In this paper, we consider the function field analogue of the Lehmer's totient problem. Let $p(x)\in\mathbb{F}_q[x]$ and $\varphi(q,p(x))$ be the Euler's totient function of $p(x)$ over $\mathbb{F}_q[x],$ where $\mathbb{F}_q$ is a finite…

Number Theory · Mathematics 2016-12-16 Qingzhong Ji , Hourong Qin

Let $\Omega$ be a bounded open interval, let $p>1$ and $\gamma>0$, and let $m:\Omega\rightarrow\mathbb{R}$ be a function that may change sign in $\Omega $. In this article we study the existence and nonexistence of positive solutions for…

Classical Analysis and ODEs · Mathematics 2015-10-06 Uriel Kaufmann , Iván Medri

Euler's totient function, $\varphi(n)$, which counts how many of $0,1,\dots,n-1$ are coprime to $n$, has an explicit asymptotic lower bound of $n/\log \log n$, modulo some constant. In this note, we generalise $\varphi$; given an…

Number Theory · Mathematics 2022-11-22 Vlad Robu
‹ Prev 1 3 4 5 6 7 10 Next ›