BdMO Online Forum

Problem:
Find the total number of the triangles whose all the sides are integer and longest side is of $100$ in length. If the similar clause is applied for the isosceles triangle then what will be the total number of triangles?

I participated in junior category and solved this successfully..I think the problem was slightly changed in hall.It was said that there can be more than one longest side.....

সেখানে কেবল isosceles triangle এর সংখ্যা বের করতে বলা হয়েছিল