Home
Class 14
MATHS
A number when divided by 6,7,15,20,21 le...

A number when divided by 6,7,15,20,21 leaves remainder '1' in each case but is completely divisible by 29. The number is

A

441

B

841

C

6561

D

2401

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem step by step, we need to find a number that meets the following criteria: 1. When divided by 6, 7, 15, 20, and 21, it leaves a remainder of 1. 2. It is completely divisible by 29. ### Step 1: Find the LCM of the numbers 6, 7, 15, 20, and 21. To find the least common multiple (LCM), we can factor each number into its prime factors: - 6 = 2 × 3 - 7 = 7 - 15 = 3 × 5 - 20 = 2^2 × 5 - 21 = 3 × 7 Now, we take the highest power of each prime number that appears in these factorizations: - The highest power of 2 is 2^2 (from 20). - The highest power of 3 is 3^1 (from 6, 15, and 21). - The highest power of 5 is 5^1 (from 15 and 20). - The highest power of 7 is 7^1 (from 7 and 21). Now, we can calculate the LCM: \[ \text{LCM} = 2^2 \times 3^1 \times 5^1 \times 7^1 = 4 \times 3 \times 5 \times 7 \] Calculating step by step: - \(4 \times 3 = 12\) - \(12 \times 5 = 60\) - \(60 \times 7 = 420\) So, the LCM of 6, 7, 15, 20, and 21 is **420**. ### Step 2: Formulate the required number. Since the number leaves a remainder of 1 when divided by these numbers, we can express the required number as: \[ \text{Required Number} = 420k + 1 \] where \(k\) is a positive integer. ### Step 3: Ensure the number is divisible by 29. Now we need to find \(k\) such that \(420k + 1\) is divisible by 29. This means: \[ 420k + 1 \equiv 0 \mod 29 \] This can be rewritten as: \[ 420k \equiv -1 \mod 29 \] First, we need to find \(420 \mod 29\): Calculating \(420 \div 29\): \[ 420 \div 29 \approx 14.4827586 \quad \text{(take the integer part, which is 14)} \] \[ 29 \times 14 = 406 \] \[ 420 - 406 = 14 \] So, \(420 \equiv 14 \mod 29\). Now we need to solve: \[ 14k \equiv -1 \mod 29 \] This is equivalent to: \[ 14k \equiv 28 \mod 29 \] To find \(k\), we can multiply both sides by the modular inverse of 14 modulo 29. The modular inverse can be found using the Extended Euclidean Algorithm, or we can test small values of \(k\): Testing \(k = 2\): \[ 14 \times 2 = 28 \equiv 28 \mod 29 \quad \text{(this works)} \] ### Step 4: Calculate the required number. Now substitute \(k = 2\) back into the equation for the required number: \[ \text{Required Number} = 420 \times 2 + 1 = 840 + 1 = 841 \] Thus, the required number is **841**. ### Summary of the Solution: The number that meets the criteria is **841**.
Promotional Banner

Topper's Solved these Questions

Similar Questions

Explore conceptually related problems

Find the least number which when divided by 16, 18 and 20 leaves a remainder 4 in each case, but is completely divisible by 7.

Find the least number which when dividded by 12, 16, 18, 30 leaves remainder 4 in each case but it is completely divisible by 7 ?

Find the smallest number which is divided by 2,3,4,5,6 and leaves remainder 1 in each case but number is exactly divisible by 7.

find the least number which divided by 2,3,4,5,6, leaves remainder of 1 in each case but when divided by 7 leaves no remaider.

The smallest number which when divided by 5 , 10 , 12 and 15 leaves remainder 2 in each case , but when divided by 7 leaves no remainder , is

What is the sum of digits of the least number which when divided by 21, 28, 30 and 35 leaves the same remainder 10 in each case but is divisible by 17?

A natural number, when divided by 4, 5, 6 or 7, leaves a remainder of 3 in each case. What is the smallest of all such numbers?

Find the least number which when divided by 16,18,20 and 25 leaves 4 as remainder in each case,but when divided by 7 leaves no remainder.

Find the least number which when divided by 6,15 and 18 leave remainder 5 in each case.