Difference between revisions of "Parity"
Totoro2017 (talk | contribs) m (→Introductory) |
m (→Problems) |
||
| Line 8: | Line 8: | ||
== Problems == | == Problems == | ||
| + | Example from 1997(!((&) AJHSME: | ||
| + | |||
| + | |||
| + | Problem | ||
| + | Ten balls numbered <math>1</math> to <math>10</math> are in a jar. Jack reaches into the jar and randomly removes one of the balls. Then Jill reaches into the jar and randomly removes a different ball. The probability that the sum of the two numbers on the balls removed is even is | ||
| + | |||
| + | <math>\text{(A)}\ \frac{4}{9} \qquad \text{(B)}\ \frac{9}{19} \qquad \text{(C)}\ \frac{1}{2} \qquad \text{(D)}\ \frac{10}{19} \qquad \text{(E)}\ \frac{5}{9}</math> | ||
| + | |||
| + | Solution 1 | ||
| + | For the sum of the two numbers removed to be even, they must be of the same parity. There are five even values and five odd values. | ||
| + | |||
| + | No matter what Jack chooses, the number of numbers with the same parity is four. There are nine numbers total, so the probability Jill chooses a number with the same parity as Jack's is <math>\frac49</math> | ||
| + | |||
| + | <math>\boxed{\text{A}}</math> | ||
| + | |||
| + | Solution 2 | ||
| + | We find that it is only possible for the sum to be even if the numbers added are both even or odd. We will get an odd number when we add an even and odd. We can use complementary counting to help solve the problem. There are a total of <math>90</math> possibilities since Jack can choose <math>10</math> numbers and Jill can pick <math>9</math>. There are <math>50</math> possibilities for the two numbers to be different since Jack can pick any of the <math>10</math> numbers and Jill has to pick from <math>5</math> numbers in the set with a different parity than the one that Jack picks. So the probability that the sum will be odd is <math>\frac{50}{90}=\frac{5}{9}</math>. Subtracting this by one gets the answer <math>\frac{4}{9}</math> (edited by qkddud) | ||
| + | |||
| + | <math>\boxed{\text{A}}</math> | ||
=== Introductory === | === Introductory === | ||
Revision as of 02:26, 20 September 2018
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
Example from 1997(!((&) AJHSME:
Problem
Ten balls numbered 
to 
are in a jar. Jack reaches into the jar and randomly removes one of the balls. Then Jill reaches into the jar and randomly removes a different ball. The probability that the sum of the two numbers on the balls removed is even is
Solution 1 For the sum of the two numbers removed to be even, they must be of the same parity. There are five even values and five odd values.
No matter what Jack chooses, the number of numbers with the same parity is four. There are nine numbers total, so the probability Jill chooses a number with the same parity as Jack's is 
Solution 2
We find that it is only possible for the sum to be even if the numbers added are both even or odd. We will get an odd number when we add an even and odd. We can use complementary counting to help solve the problem. There are a total of 
possibilities since Jack can choose numbers and Jill can pick 
. There are 
possibilities for the two numbers to be different since Jack can pick any of the numbers and Jill has to pick from 
numbers in the set with a different parity than the one that Jack picks. So the probability that the sum will be odd is 
. Subtracting this by one gets the answer 
(edited by qkddud)
Introductory
Intermediate
This article is a stub. Help us out by expanding it.
