Fermat's Last Theorem (sometimes called Fermat's conjecture, especially in older texts) states that no three positive integers a, b, and c can satisfy the equation a^n + b^n = c^n for any integer value of n greater than two.
By adopting n=2 and given A and B, the function C=fermat(A,B) return the sort row vector C with all solution c (not c^n) for (0<a=<A , 0<b<=B).
it is a really nice code!! Several rather practical skills like implicit expansion, integer judgement are involved. Learned a lot. THX.
The Goldbach Conjecture, Part 2
900 Solvers
166 Solvers
Sum of diagonal of a square matrix
1105 Solvers
How long is the longest prime diagonal?
263 Solvers
381 Solvers