Parity

Revision as of 16:55, 24 July 2017 by Frednacy (talk | contribs) (Introductory)

Parity refers to whether a number is even or odd.

While this may seem highly basic, checking the parity of numbers is often an useful tactic for solving problems, especially with proof by contradictions and casework.

This concept begins with integers. An even number is an integer that is "evenly divisible" by 2, i.e., divisible by 2 without remainder; an odd number is an integer that is not evenly divisible by 2. (The old-fashioned term "evenly divisible" is now almost always shortened to "divisible".) A formal definition of an even number is that it is an integer of the form n = 2k, where k is an integer; it can then be shown that an odd number is an integer of the form n = 2k + 1.

This only applies to integers, not fractions or decimals.

Problems

Introductory

SPAMMMM

Intermediate

This article is a stub. Help us out by expanding it.

Invalid username
Login to AoPS