Edit: I goofed up. Need to show that If $$(a^m+b^m)^{n}= (a^n+b^n)^m$$ then $m=n$ where $a,b$ are fixed positive reals and $m,n\in\mathbb{N} $
2026-04-03 06:18:50.1775197130
Proof that $(a^m+b^m)^{n}= (a^n+b^n)^m\implies m=n$
68 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
3
Factorizing by $a$ you obtain: $$\left(1+\left(\frac{a}{b} \right)^n \right)^{m}=\left(1+\left(\frac{a}{b} \right)^m \right)^{n}$$ with $x=\left(\frac{a}{b} \right)^n$ this is the same as: $$\left(1+x \right)^{m}=\left(1+x^\frac{m}{n}\right)^{n}$$ i.e $$\left(1+x \right)^\frac{m}{n}=\left(1+x^\frac{m}{n}\right)$$ so this is the same as showing that if it exists $x>0$ such that: $$(1+x)^\gamma=(1+x^\gamma)$$ then $\gamma=1$.
Let $f(x)=(1+x)^\gamma-(1+x^\gamma)$
Then if $\gamma \neq 1$ $$f'(x)=\gamma \left((1+x)^{\gamma-1}- x^{\gamma-1}\right)$$ so if $\gamma >1$ the function is strictly increasing and if $\gamma<1$ strictly decreasing. In both cases as $f(0)=0$ there is no $x>0$ such that $f(x)=0$.
So $\gamma=1$.