How does one approach this problem, where all $\sqrt{\frac{4n-2}{n+5}}$ is a rational number when $n \in \mathbb{Z}$.
Find all $n \in \mathbb{Z}$ such that $\sqrt{\frac{4n-2}{n+5}}$ is a rational number
-
5If $\sqrt{\frac{p}{q}} \in \mathbb{Q}$, then $q\sqrt{\frac{p}{q}} \in \mathbb{Q}$. – 2017-01-11
-
2((Post-hoc check: Unique solution $n=13$.)) – 2017-01-11
-
0@Did: I'm a little confused. For what $p,q \mathbb \in Z$ is $$\sqrt{\frac{4\times13-2}{13+5}}=\sqrt{\frac{50}{18}}=\frac pq?$$ – 2017-01-11
-
1@zoli Hint: $\frac{50}{18}=\frac{25}9$. – 2017-01-11
-
0@zoli: $50/18 = 25/9$; so $p=5, q=3$. – 2017-01-11
-
0Oh, stupid of me... Sleepy. – 2017-01-11
-
0@zoli Thus, stops doing maths, goes to bed, and then restarts doing maths... :-) – 2017-01-12
3 Answers
Let $p,q$ be relatively prime positive integers such that $$\frac{4n-2}{n+5} = \frac{p^2}{q^2}$$
(note that $p\neq 0$ because $4n-2=0$ doesn't have integer solution.)
Then, we have $4n-2 = q^2k$, $n+5=p^2k$, $k\in\Bbb Z$. Now, $$4n-2 = 4(n+5) - 22\implies (4p^2-q^2)k = 22 \implies (2p-q)(2p+q)k = 22.$$
Notice that $2p-q\equiv2p+q\pmod 2$, and since $4\not\mid 22$, they must both be odd, implying that $$(2p-q)(2p+q)\mid 11$$
This leads to small number of cases:
- $(2p-q)(2p+q) = 11$
(We will come back to this case.)
- $(2p-q)(2p+q) = -11$
This would imply that $(2p-q)+(2p+q) = \pm 10$. Contradiction.
- $(2p-q)(2p+q) = 1$
This would imply that $2p-q=2p+q$, i.e. $q = 0$. Contradiction.
- $(2p-q)(2p+q) = -1$
This would imply that $(2p-q)+(2p+q) = 0$, i.e. $p = 0$. Contradiction.
Finally, we conclude that $(2p-q)(2p+q) = 11$, and since $2p-q<2p+q$, we have that $2p-q = 1$ and $2p-q=11$ (the other case when negative factors are chosen leads to negative $p$ and $q$). Solving the system we get $p=3$ and $q = 5$ (also, $k = 2$). This gives us
\begin{align} 4n-2 &= 50\\ n+5 &= 18 \end{align}
which implies that $n = 13$.
If so there are coprime $\,a,b\,$ with $\,\dfrac{4n\!-\!2}{n\!+\!5} = \dfrac{a^2}{b^2}\ $ so $\,\begin{align}4n\!-\!2 &\,=\, ca^2\\ n\!+\!5 &\,=\, cb^2\end{align}\,,\,$ $\, c=\gcd(4n\!-\!2,n\!+\!5)$
Eliminating $\,n\,$ yields $\ {-}22\, =\, c(a^2-4b^2)\, =\, c(a-2b)(a+2b)$
So we need only test when $\,-22/c\,$ splits into factors $\,a\pm 2b\,$ that are $\,\equiv\!\pmod{\! 4},\,$ a few cases.
-
1Why this answer received downvote, while mine did not is beyond me. When I typed everything, I've noticed that you've already written it before me, but I felt that I've invested too much time into it to remove it. Anyway, since I can't upvote my answer, I will upvote this one. – 2017-01-12
As observed in the comments to the question, $p/q$ is a rational square if and only $pq$ is an integer square. Therefore $(4n-2)(n+5)=4n^2+18n-10$ should be a square: $$ 4n^2+18n-10-k^2=0 $$ Then $121+4k^2$ must be a square. Thus we have a primitive Pythagorean triple (note that $11\mid k$ leads to a contradiction).
-
0There is exactly one Pythagorean triple with $11$, namely $(11,30,61)$, as the downvoter can easily check. – 2017-01-12
-
0fyi: My answer was downvoted 1 second after yours, so probably the downvotes have nothing to do with the *mathematics*. Alas, the frequency of these types of downvotes appears to be increasing as of late. – 2017-01-12