I was able to do this because I recently solved this type of problem in quadratic where RHS is prime and product of LHS has to be equal to the number or 1
out of interest, is there an integer solution to a sum of squares equalling 257 ? Is there some theorem saying something like any number canbe respresented as a sum of squares of two numbers!?!
There’s a theorem (from Lagrange I think) that claims that every integer can be written as the sum of 4 squares or less, so for some of them 2 is impossible
@@clementfradin5391 Thanks, awfully good of you. Yes, I remember reading something of that sort... on one of the popular maths books. As it happens so many times a bit late, I have just spotted that 257 is is sum of two squares: 1 and 16.
Brahmagupta-Fibonacci coming is clutch as always.
@@quite_unknown_1 💪💪💪
I was able to do this because I recently solved this type of problem in quadratic where RHS is prime and product of LHS has to be equal to the number or 1
isn't this technically 3 equations not 2
No.. They are describing the solution to a set of two equations
2 equations and 1 extra info being abcd r integers
out of interest, is there an integer solution to a sum of squares equalling 257 ? Is there some theorem saying something like any number canbe respresented as a sum of squares of two numbers!?!
There’s a theorem (from Lagrange I think) that claims that every integer can be written as the sum of 4 squares or less, so for some of them 2 is impossible
@@clementfradin5391 Thanks, awfully good of you. Yes, I remember reading something of that sort... on one of the popular maths books. As it happens so many times a bit late, I have just spotted that 257 is is sum of two squares: 1 and 16.
What does Brahmagupta-Fibonnaci mean