This is the detailed explanation for the Explanation for the Arithmetic Quiz 04. Each question’s solution is broken down step-by-step to help you understand the core concepts of remainders, HCF, and LCM.
1. Find the least number which will leaves remainder 5 when divided by 8, 12, 16 and 20.
Answer: 245
- Find the LCM (Least Common Multiple) of the divisors. The number must be a multiple of the LCM of 8, 12, 16, and 20.
- Prime factorization:
- 8 =
- 12 =
- 16 =
- 20 =
- LCM = .
- Prime factorization:
- Add the remainder. The number must be 5 more than a multiple of 240.
- Number = LCM + Remainder = .
2. Three numbers are in ratio 1:2:3 and HCF is 12. The numbers are:
Answer: 12, 24, 36
- Understand the relationship between numbers, HCF, and ratio. If numbers are in a given ratio, and their HCF is known, the numbers themselves are the HCF multiplied by each term in the ratio.
- Calculate the numbers.
- First number =
- Second number =
- Third number =
3. Find the remainder when 6799 is divided by 7.
Answer: 6
- Divide the number by the divisor.
- Perform the division.
- .
- Identify the remainder. The remainder is 6.
4. After the division of a number successively by 3, 4 and 7, the remainder obtained is 2, 1 and 4 respectively. What will be remainder if 84 divide the same number?
Answer: 53
- Find the smallest number that fits the conditions. This is a reverse-calculation problem.
- Start from the last division. A number divided by 7 gives a remainder of 4. Let’s take the smallest such number: .
- This number (11) was the quotient from the previous step. A number divided by 4 gives a remainder of 1 and a quotient of 11. The number is .
- This number (45) was the quotient from the first step. A number divided by 3 gives a remainder of 2 and a quotient of 45. The number is .
- Divide the found number by 84.
- Find the remainder.
- . The remainder is 53.
5. Find the remainder when is divided by 34.
Answer: 30
- Find the remainder for each number when divided by 34. This is modular arithmetic.
- remainder is .
- remainder is .
- remainder is .
- remainder is . (or -11)
- remainder is . (or -7)
- remainder is .
- Multiply the remainders.
- .
- Simplify the multiplication by taking remainders again.
- .
- . .
- . .
- Now, we have .
- Find the remainder of the final product.
- .
- Wait, the answer is 30. Let’s re-calculate.
- Product of remainders:
- .
- . The remainder is 32. The provided answer of 30 is likely incorrect.
6. What is the least number of soldiers that can be drawn up in troops of 12, 15, 18 and 20 soldiers and also in form of a solid square?
Answer: 900
- Find the LCM of the troop sizes. The number of soldiers must be a multiple of 12, 15, 18, and 20.
- LCM of 12, 15, 18, 20.
- 12 =
- 15 =
- 18 =
- 20 =
- LCM = .
- LCM of 12, 15, 18, 20.
- Check if the LCM is a perfect square. 180 is not a perfect square.
- Multiply the LCM by the missing factors to make it a perfect square. To be a perfect square, all prime factors in its prime factorization must have even powers. The prime factors of 180 are . The factor ‘5’ has an odd power. We need to multiply by 5 to make the power even ().
- Number = .
- Confirm the number is a perfect square. .
7. Find the remainder when is divided by 6.
Answer: 4
- Examine the pattern of powers of 4.
- . remainder is 4.
- . remainder is 4.
- . remainder is 4.
- Identify the pattern. Any positive integer power of 4 ( for ) when divided by 6 will have a remainder of 4.
8. Find the remainder when is divided by 17.
Answer: 1
- Use Fermat’s Little Theorem. The theorem states that if ‘p’ is a prime number, then for any integer ‘a’, the number is an integer multiple of ‘p’. In other words, . If ‘a’ is not divisible by ‘p’, then .
- Apply the theorem to the problem.
- Here, and . 17 is a prime number, and 2 is not divisible by 17.
- According to the theorem, .
- Use the property of exponents. We need to find the remainder of . We can express 256 in terms of 16.
- .
- .
- Find the remainder.
- .
- The remainder is 1.
9. , where n is an integer >0, is divisible by
Answer: All of these
- Test the expression for n=1.
- . This doesn’t help much.
- Test for n=2.
- . This is divisible by 13.
- Test for n=3.
- . This is divisible by 127.
- Use the algebraic formula: .
- . This shows it’s always divisible by . Not helpful.
- Let’s reconsider the question and options.
- The options are 13, 127, and 559.
- For , the value is 13.
- For , the value is 127.
- What is the divisibility of the expression in general?
- For any odd n, is divisible by .
- For any even n, is divisible by and .
- The question has . So . The expression is not guaranteed to be divisible by . For example, for , which is not divisible by 13.
- There seems to be a mistake in the question’s premise or the “All of these” option. Let’s assume the question meant a specific value of n, or a different expression.
- Let’s check the number 559. .
- The question is flawed. The expression is divisible by 13 for even n, and by 127 for n=3, and by 1 for any n. The phrase “is divisible by” implies it is always divisible. This is not true for all ‘n’. The answer “All of these” is highly suspect.
10. Let N = 1421*1423*1425. What is the remainder when N is divided by 12?
Answer: 9
- Find the remainder of each number when divided by 12.
- . Remainder is 5.
- . Remainder is 7.
- . Remainder is 9.
- Multiply the remainders and find the remainder of the product.
- . . Remainder is 11.
- . . Remainder is 3.
- Wait, the provided answer is 9. Let’s re-calculate.
- .
- . . Remainder is 3.
- Let’s try another method.
- . Remainder is 3.
- The provided answer of 9 is incorrect based on the numbers given. The correct answer is 3.