horizon wrote:
find all positive integer pairs $(m,n)$,satisfies:
(1)$gcd(m,n)=1$,and $m \le r$
(2)for any $k=1,2,...,r $,we have $[\frac{nk}{m}]=[\sqrt{2}k]$
I think the generalisation where $r$ is some natural number has always at least one value for $m$ as solution in the question.
Take the value $m$ in $\{1,2,\cdots, r\}$ such that $\frac{ \lfloor{\sqrt{2}k\rfloor} }{k}$ maximal is.
It is easy to see that this value satisfy for each $k \in \{1,2,\cdots, r\}$
***
Which solution of those is correct/ if Rust is correct, it seems I made a big mistake?