All Exams Test series for 1 year @ ₹349 only
Question

What is the least number which when doubled is perfectly divisible by 7, 12 and 15?

This question was previously asked in
RRB ALP 2018 CBT 2 Fitter Question Paper (21-Jan-2019) (Shift 3)
The correct answer is

210

Finding the Least Number Doubled Divisible by 7, 12, and 15

The question asks for the least number which, when doubled, is perfectly divisible by three given numbers: 7, 12, and 15.

If a number is perfectly divisible by 7, 12, and 15, it must be a common multiple of these three numbers. The least such number is the Least Common Multiple (LCM) of 7, 12, and 15.

Let the required least number be \(x\). According to the problem, when \(x\) is doubled, the result (\(2x\)) is perfectly divisible by 7, 12, and 15. This means that \(2x\) must be a multiple of the LCM of 7, 12, and 15.

Understanding Divisibility and Least Common Multiple (LCM)

Divisibility means that when one number is divided by another, the remainder is zero. A common multiple of a set of numbers is a number that is a multiple of every number in the set. The Least Common Multiple (LCM) is the smallest positive number that is a common multiple of two or more numbers.

Calculating the LCM of 7, 12, and 15

To find the LCM, we can use the prime factorization method. We find the prime factors of each number:

  • Prime factors of 7: \(7 = 7^1\)
  • Prime factors of 12: \(12 = 2 \times 2 \times 3 = 2^2 \times 3^1\)
  • Prime factors of 15: \(15 = 3 \times 5 = 3^1 \times 5^1\)

To find the LCM, we take the highest power of all the prime factors that appear in any of the numbers:

Number Prime Factorization
7 \(7^1\)
12 \(2^2 \times 3^1\)
15 \(3^1 \times 5^1\)

The prime factors involved are 2, 3, 5, and 7.

  • Highest power of 2: \(2^2\) (from 12)
  • Highest power of 3: \(3^1\) (from 12 and 15)
  • Highest power of 5: \(5^1\) (from 15)
  • Highest power of 7: \(7^1\) (from 7)

LCM(7, 12, 15) = \(2^2 \times 3^1 \times 5^1 \times 7^1 = 4 \times 3 \times 5 \times 7\)

LCM(7, 12, 15) = \(12 \times 35 = 420\)

Solving for the Least Number

As established earlier, \(2x\) must be a multiple of LCM(7, 12, 15). To find the least such number \(x\), \(2x\) must be the least multiple of LCM(7, 12, 15), which is LCM(7, 12, 15) itself.

So, we have the equation: \(2x = \text{LCM}(7, 12, 15)\) \(2x = 420\)

Now, we solve for \(x\) by dividing both sides by 2: \(x = \frac{420}{2}\) \(x = 210\)

Thus, the least number is 210.

Verifying the Solution

Let's check if doubling 210 is perfectly divisible by 7, 12, and 15.

Doubling 210 gives \(2 \times 210 = 420\).

  • Is 420 divisible by 7? \(420 \div 7 = 60\). Yes.
  • Is 420 divisible by 12? \(420 \div 12 = 35\). Yes.
  • Is 420 divisible by 15? \(420 \div 15 = 28\). Yes.

Since 420 is perfectly divisible by 7, 12, and 15, our calculated number, 210, is indeed the least number that satisfies the condition.

Revision Table: Key Concepts

Concept Definition Relevance to Problem
Divisibility A number \(a\) is divisible by \(b\) if \(a = bk\) for some integer \(k\). Used to define the condition on the doubled number.
Multiple A multiple of a number \(n\) is \(nk\) for some integer \(k\). The doubled number must be a common multiple of 7, 12, and 15.
Least Common Multiple (LCM) The smallest positive integer that is a multiple of two or more numbers. The doubled number, to be the minimum possible value, must equal the LCM of 7, 12, and 15.
Prime Factorization Expressing a number as a product of its prime factors. Method used to efficiently calculate the LCM.

Additional Information: Number Properties

Understanding multiples, factors, and LCM is fundamental in number theory. Related concepts include:

  • Factors: Numbers that divide a given number evenly. For example, the factors of 12 are 1, 2, 3, 4, 6, and 12.
  • Common Factors: Factors that two or more numbers share. For example, common factors of 12 and 18 are 1, 2, 3, and 6.
  • Highest Common Factor (HCF) or Greatest Common Divisor (GCD): The largest of the common factors. For example, HCF(12, 18) = 6.

LCM is particularly useful when dealing with problems involving cycles, events that repeat at regular intervals, or finding the smallest quantity that can be divided equally into different-sized groups. HCF is useful when dividing quantities into the largest possible equal parts.

Was this answer helpful?

Similar Questions

  1. When x 2+ ax + b is divided by (x - 1), the remainder is 15 and when x 2+ bx + a is divided by (x + 1), the reminder is -1, then the value of a 2+ b 2is:

  2. Find the smallest square number from among the given options, which is divisible by each of 8, 15 and 20.

  3. If the 8 digit number 136p5785 is divisible by 15, then find the least possible value of P.

  4. How many of the factors of 360 are perfect squares?

  5. Which of the following numbers is divisible by 12?

  6. If the number x3331 is divisible by 11, what is the face value of x?
  7. 1

    ?

    3

    Find the missing digit if it has 11 and 13 as factors?

  8. A 4-digit number 1xy7 is divisible by 11. What is the value of x - y?

  9. 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?

  10. Which of these numbers is divisible by 6?


Important Questions from Divisibility and Remainder

  1. If the 8-digit number 888x53y4 is divisible by 72, then what is the value of (7x + 2y), for the maximum value of y?

  2. If all positive divisors of 132 are arranged in descending order, then what digit will be at unit place of first divisor ?

  3. If 3 2019 is divided by 10, then what is the remainder?

  4. The number 3798125P369 is divisible by 7. What is the value of the digit P?

  5. Consider all 3-digit numbers (without repetition of digits) obtained using three non-zero digits which are multiples of 3. Let S be their sum.

    Which of the following is/are correct?

    1. S is always divisible by 74.

    2. S is always divisible by 9.

    select the correct answer using the code given below:

Need Expert Advice?
Upcoming Exams
RRB Technician
October 06, 2026
RRB JE
October 27, 2026
RRB ALP
November 03, 2026
Test Series
RRB ALP img
Railways
RRB ALP 2026 Mock Test series
1035 Tests 1 Tests Free
1081 Attempts
4.3(238)
English, Hindi

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App