Numbers in Pythagorean Form

For a Pythagorean triple , we know that

0 = a 2 + b 2 c 2 0 = a^2 + b^2 - c^2

What is the smallest positive integer n n , such that there does not exist integers a , b , c a,b,c where

n = a 2 + b 2 c 2 ? n = a^2 + b^2 - c ^2 ?

10000 n 10000 \leq n 100 n < 10000 100 \leq n < 10000 1 n < 100 1 \leq n < 100 All positive integers can be represented in this form

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Maria Kozlowska
Nov 14, 2016

Let b = c + 1 b=c+1 . Then b 2 c 2 = 2 c + 1 b^2-c^2=2c+1 . For a = 0 , c 0 a=0, c \geq 0 we cover all odd numbers, for a = 1 , c 0 a=1, c \geq 0 all even numbers.

Clean construction :)

We can also get all the negative integers in a similar way.

Calvin Lin Staff - 4 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...