for all a,b,c are integers, there exists an integer solution to ax^2 +by^2=c, whenever gcd(a,b)|c
can u prove this
or disprove it
no i cannot, at least it is not obvious
i think i might be getting somewhere
ok cuz i'm not
ok let me type what i have
Ok there is ordered pair (m,n) where m and n are integers such that \[am^2+bn^2=c.............(1)\] If gcd(a,b)=d, then there are integers j,k such that aj+bk=d. If gcd(a,b)|c, then there is integer l such that ld=c. If ld=c and aj+bk=d, then aj+bk=c/l \[aj+bk=\frac{c}{l}=>ajl+bkl=c\] but ji and kl are integers so let's just write M for ji and L for kl where M and L are integers. So we have \[aM+bL=c\] by equation (1) this implies \[M=m^2 \& L=n^2\] if M and L are not perfect squares, then we do not have integers if M and L are perfect squares, then we do have integers m and n
but if m is an integer then so is m^2
but if M is not a perfect square and if L is not a perfect square then m and n are not integers (contradiction)
and lets say or instead of and
ok so you have disproven it thanks
but if M is not a perfect square or if L is not a perfect square then m or n are not integers (contradiction)
we it is true for perfect squares M and L
so yes i have disproved it
since it is not true for all M and L
o right because its "there exists" not "for all"
man im confused
i think now youve proven it
lol i think to because i did prove there exists integers that satisfy that equation given the conditions
yep ok ill work on it thanks
for all a,b,c are integers, there exists an integer solution to ax^2 +by^2=c, whenever gcd(a,b)|c for any integers ...I pick a=2,b=3 and c=1 then the gcd(a,b)=1 and 1|c but 2x^2 +3y^2=1 has no integer solutions
oh yes it is easier than i thought just find a counterexample
zarkon what do you think of what i wrote?
here is what i got
whats my grade?
jas...I'm switching browsers
d=gcd(a,b) d|c kd=c ax+by=d so ax+by=c/k then akx +bky=c this implies that kx=x^2, and ky=y^2 this can't be true because y cant equal x
I would just stick to a counter example
ya but they say prove i think they need that
@myininaya looks good...I can't give an A+ though since you did it the long way :) Also it is possible the M and L are perfect squares (some of the numbers do have solutions)
:(
right
and i stated this so i get an A
A+*
the Dual of A+...sweet!
i got a lot of duals of A+ i think i lived in the dual space all through school
lol
satellite someone thought we were bad earlier
really? i thought i deleted everything bad that i wrote
if gcd(a,b)=1, then gcd (2a+b,a+2b) is 1 or 3 : prove
@myininaya can you tell me in chat?
ok....notice that \[2(2a + b) − (a + 2b) = 3a.\] \[2(a + 2b) − (2a + b) = 3b\] now work it out from here ...
k i know where to go from there but did you just get the 2 intuitively?
and why minus
I was just playing around with linear combinations...I should have seen it much sooner than I did :)
does d|any linear combination of 2a+b and 2b+a
yes
then d=gcd(3a,3b) d=3gcd(a,b) then 3d=gcd(a,b)
not exactly
d/3
d|gcd(3a,3b)=3gcd(a,b)=3 thus d|3
right and the 1 is given
yep
k cool thx
Join our real-time social learning platform and learn together with your friends!