Competition problem — Number theory

Library / /104 of 520

Number theory Difficulty 5.6 AIME, harder Prove it

2. Show that if $x, y, z$ is a primitive Pythagorean triple, then either $x$ or $y$ is divisible by 3 .

Solution

None

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.