It is known that the two right sides of a right triangle are l and M. the hypotenuse is n.. And l.m.n is a positive integer.. L is a prime number! Prove that 2 [L + m + 1] is a complete square Let me understand! There is really a hurry! A points used up! Better than good consciousness! As good deeds!

It is known that the two right sides of a right triangle are l and M. the hypotenuse is n.. And l.m.n is a positive integer.. L is a prime number! Prove that 2 [L + m + 1] is a complete square Let me understand! There is really a hurry! A points used up! Better than good consciousness! As good deeds!

The prime number is 1 3 5 7 9, because l m n is an integer and a right triangle, so the three sides are 3 4 5
So that number 16 is the perfect square of 4

C + + program to find and output the number m between 11 and 999, which satisfies that m, M2 and M3 are palindromic numbers. Palindromic integers: all numbers are symmetric integers

#include
void main()
{
int i;
for(i=11;i

M ^ 2-1 = 1001 * 999=
ditto

m=1000