อยากได้ไอเดียคร่าวๆในการเขียนโปรแกรมข้อนี้หน่อยครับ
Write programs to do following:
Given a positive integer n search for solutions of the diophantine equation x
n + y
n = z
n.
(This diophantine equation has no solutions in nonzero integer x, y, z when n is an integer with n ≥ 3.)
Computer Programing of Fermat's Last Theorem
Write programs to do following:
Given a positive integer n search for solutions of the diophantine equation xn + yn = zn.
(This diophantine equation has no solutions in nonzero integer x, y, z when n is an integer with n ≥ 3.)