Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2008-12-07 02:14:03

tony123
Member
Registered: 2007-08-03
Posts: 229

divisible by

let

integers

and

prove that

divisible by
,

OR
OR
divisible by

Offline

#2 2008-12-07 23:23:18

JaneFairfax
Member
Registered: 2007-02-23
Posts: 6,868

Re: divisible by

Pythagorean triples are of the form



where

are positive integers with
.

If one or both of m and n are even, then C is divisible by 4; otherwise they are both odd and so B would be divisible by 4.

And in this thread

http://www.mathisfunforum.com/viewtopic.php?id=11085

it is proved that 60 divides the product ABC, i.e. 5 (a prime) divides one of A, B, C.

Offline

#3 2008-12-08 21:14:11

JaneFairfax
Member
Registered: 2007-02-23
Posts: 6,868

Re: divisible by

I slightly got ahead of myself there. I meant to say that if

and
are both odd, then
would be even and so
would be divisible by
.

Offline

Board footer

Powered by FluxBB