We know $ax+by=c$ is solvable iff $(a,b)|c$ where $a,b,c,x,y$ are integers. If $x=2$, $a=\dfrac{k(k+5)}{2}$, $y=k$, $b=k+3$ and $c=2k$, where $k$ is any integer, then $2 \frac{k(k+5)}{2} - k(k+3) = 2k.$ So, $\left(\dfrac{k(k+5)}{2}, (k+3)\right) | 2$ for all integral value of $k$. But $k+3$ cannot be even unless $k$ is odd. Where I am going wrong?
Some doubt on Linear Diophantine equation
1
$\begingroup$
elementary-number-theory
-
0A newly found article on Diophantine equation http://www.iosrjournals.org/iosr-jm/pages/v7i4.html – 2013-08-19
3 Answers
5
$2k(k+5)/2 - k(k+3)=2k$ with $a=k(k+5)/2$, $x=k$, $y=k$, would mean $b=k+3$, not $k(k+3)$. The conclusion is that $(k(k+5)/2,k+3) | 2k$, not $2$. For example, with $k=3$, $(24,6)=6$.
-
0Good observation, I missed it – 2012-07-02
2
Why does $k+3$ need to be even for the gcd of $k(k+5)/2$ and $k+3$ to divide $2$? For instance, consider the $k=2$ case.
Now, if $2$ had to divide the gcd of those numbers, then we could conclude that $k+3$ must be even.
-
1"So, (k(k+5)/2, (k+3)) | 2 for all integral value of k. =>k+3 is even for all integral value of k" is what you said. This implication fails to hold, with the counterexample $k=2$. I'm simply pointing out that fact. – 2012-07-02
1
Let $\rm\:j = (k\!+\!3,\, k(k\!+\!5)/2).\,$ The solvability criterion is $\rm\,j\:|\:2k,\,$ not $\rm\:j\:|\:2.\,$ The two are equivalent only when $\rm\:(j,k) = 1\iff (k,3) = 1.$ Otherwise $\rm\:3\:|\:k\:|\:j\:$ thus $\rm \:j\nmid 2.$