Question
Let and be distinct integers where and . Then, the number of ways of choosing and , such that is divisible by 5, is ____________.
Answer: 5
Solution
Key Concepts and Formulas
- Divisibility rule: A number is divisible by 5 if its last digit is either 0 or 5.
- Counting principle: If there are ways to do one thing and ways to do another, then there are ways to do both.
- Permutations: Since and are distinct, the order matters.
Step-by-Step Solution
Step 1: Categorize the integers based on their remainders when divided by 5.
We divide the integers from 1 to 25 into 5 categories based on their remainders when divided by 5.
- Numbers of the form : 5, 10, 15, 20, 25 (5 numbers)
- Numbers of the form : 1, 6, 11, 16, 21 (5 numbers)
- Numbers of the form : 2, 7, 12, 17, 22 (5 numbers)
- Numbers of the form : 3, 8, 13, 18, 23 (5 numbers)
- Numbers of the form : 4, 9, 14, 19, 24 (5 numbers)
Step 2: Determine the pairs of remainders that sum to a multiple of 5.
For to be divisible by 5, the sum of their remainders when divided by 5 must be divisible by 5. The possible pairs of remainders are:
- 0 + 0
- 1 + 4
- 2 + 3
- 3 + 2
- 4 + 1
Step 3: Count the number of ways to choose and for each pair of remainders.
-
Case 1: Both and are of the form . There are 5 choices for . Since and must be distinct, there are 4 choices for . So, there are ways.
-
Case 2: is of the form and is of the form . There are 5 choices for and 5 choices for . So, there are ways.
-
Case 3: is of the form and is of the form . There are 5 choices for and 5 choices for . So, there are ways.
-
Case 4: is of the form and is of the form . There are 5 choices for and 5 choices for . So, there are ways.
-
Case 5: is of the form and is of the form . There are 5 choices for and 5 choices for . So, there are ways.
Step 4: Calculate the total number of ways.
The total number of ways is .
Common Mistakes & Tips
- Remember to account for the condition that and are distinct.
- Be careful when counting the number of elements in each category.
- Don't forget to consider all possible pairs of remainders that sum to a multiple of 5.
Summary
We categorized the integers from 1 to 25 based on their remainders when divided by 5. Then we found the pairs of remainders that sum to a multiple of 5. Finally, we counted the number of ways to choose and for each pair of remainders, remembering that and must be distinct. Summing the counts for each case gives the total number of ways.
The final answer is \boxed{120}.