A pair of positive integers $(m,n)$ is called 'steakmaker' if they maintain the equation 1 + 2$^m$ = n$^2$. For which values of m and n, the pair $(m,n)$ are steakmaker, find the sum of $mn$
Problem
Source: BdMO Final 2020 Primary Category Problem 1
Tags: number theory
30.08.2020 23:21
I think only pairs are $(0,1)$ and $(3,3)$ so answer is $9$.
30.08.2020 23:48
May be you have used trial and error method. But can you give formal argument ?
31.08.2020 00:07
$n^2-1=2^m$ so $n-1=2^a,n+1=2^b,a+b=m$ $2^{b-a}=\frac{n+1}{n-1}=1+\frac{2}{n-1}$ so $n$ can be only $2,3$ but for $n=2$ there are not solutions, so $(m,n)=(3,3)$
31.08.2020 03:48
RagvaloD wrote: $n^2-1=2^m$ so $n-1=2^a,n+1=2^b,a+b=m$ $2^{b-a}=\frac{n+1}{n-1}=1+\frac{2}{n-1}$ so $n$ can be only $2,3$ but for $n=2$ there are not solutions, so $(m,n)=(3,3)$ But in the term $2^{b-a}$ when $a>b$ then what happen?
31.08.2020 04:20
If $a>b$ then $2^{b-a}<1$, but $1+\frac{2}{n-1}$ is clearly greater than $1$, so we have no solutions.
31.08.2020 06:42
10.10.2020 13:40
By Mihaeliscu's Theorem (I don't know how to spell it ), we know that the only consecutive powers are $(8, 9)$ and $(1, 2)$. Clearly we can't have $m = 0$, otherwise $n$ wouldn't be an integer. So it would be $(8, 9)$ the pair. This would imply that $m = 3$ and $n = 3$ hence $mn = \boxed{9}$.
01.01.2022 00:22
By Catalan' theorem: $\implies 2^m=8 ; n^2=9$ $\implies m=3 ; n=3$ $\implies mn=9$