Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (anonymous):

prove to disprove: a)If there exists an integer solution to ax^2+by^2=c, then gcd(a,b)|c b)if gcd(a,b)|c, there exists an integer solution to ax^2+by^2=c. I don't know where to start..any help please.. thank you~

OpenStudy (anonymous):

a) first part is clear, suppose there exists an integer solution to ax^2+by^2=c and\[d=\gcd(a,b)\]then\[d|ax^2+by^2=c \ \ \rightarrow \ \ d|c\]

OpenStudy (anonymous):

b) second part, let a=1, b=2 and c=3...see what happens

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!