Find all triples $(x,y,z)$ of positive integers such that $(x+1)^{y+1}+1=(x+2)^{z+1}$.
Problem
Source: 8-th Taiwanese Mathematical Olympiad 1999
Tags: number theory proposed, number theory
20.01.2007 22:53
Trivial by Mihailescu's Theorem
21.01.2007 06:08
t0rajir0u wrote: Mihailescu's Theorem What is it?
21.01.2007 06:14
Mihailescu is the one who proved Catalan's conjecture.
21.01.2007 06:47
ZetaX wrote: Mihailescu is the one who proved Catalan's conjecture. But what is Mihailescu's Theorem ?
21.01.2007 06:57
Well, proving a conjecture leads often to them be named after you... Oh, and there is also google
21.01.2007 07:07
Ok! It here http://mathworld.wolfram.com/CatalansConjecture.html But above problem has level is Olympiad?
21.01.2007 15:04
i smel here short listed problem 2000. find all natural numbers such:$a^{m}+1=(a+1)^{n}$. and also there is generalisation for this $a^{m}+1|(a^{k}+1)^{n}$. i will post my solution using elementry number theory.
21.01.2007 15:17
Both are trivial after using Zsygmoni (and it is elementary)
21.01.2007 19:03
ZetaX wrote: Zsygmoni What is it? again
21.01.2007 19:09
Sorry, it's spelled "Zsigmondy", see http://mathworld.wolfram.com/ZsigmondyTheorem.html .
18.05.2023 04:57
N.T.TUAN wrote: Find all triples $(x,y,z)$ of positive integers such that $(x+1)^{y+1}+1=(x+2)^{z+1}$. By Mihailescu's Theorem: $\Rightarrow (x,y,z)=(1,2,1)$ By Zsigmondy's Theorem: $\exists$ prime $p/ p|(x+1)^{y+1}+1, p\nmid x+2$ $\Rightarrow 0\equiv (x+2)^{z+1} \pmod{p} (\Rightarrow \Leftarrow)_\blacksquare$ But there are exceptions: $\Rightarrow (x,y,z)=(1,2,1)$
01.07.2024 11:41
ZetaX wrote: Sorry, it's spelled "Zsigmondy", see http://mathworld.wolfram.com/ZsigmondyTheorem.html . Thank you I need this too