Home
Class 14
MATHS
The product of two co-prime numbers is 9...

The product of two co-prime numbers is 945 then find their LCM ?

A

189

B

35

C

27

D

945

Text Solution

AI Generated Solution

The correct Answer is:
To find the Least Common Multiple (LCM) of two co-prime numbers whose product is given as 945, we can follow these steps: ### Step-by-Step Solution: 1. **Understanding Co-prime Numbers**: Co-prime numbers are two numbers that have no common factors other than 1. This means that their highest common factor (HCF) is 1. 2. **Given Information**: We are given that the product of two co-prime numbers \( N_1 \) and \( N_2 \) is 945. \[ N_1 \times N_2 = 945 \] 3. **Using the Relationship Between LCM and HCF**: The relationship between the LCM and HCF of two numbers is given by: \[ \text{LCM}(N_1, N_2) \times \text{HCF}(N_1, N_2) = N_1 \times N_2 \] 4. **Substituting the Known Values**: Since \( N_1 \) and \( N_2 \) are co-prime, we know that: \[ \text{HCF}(N_1, N_2) = 1 \] Therefore, substituting this into the relationship gives us: \[ \text{LCM}(N_1, N_2) \times 1 = 945 \] 5. **Finding the LCM**: This simplifies to: \[ \text{LCM}(N_1, N_2) = 945 \] 6. **Conclusion**: Thus, the LCM of the two co-prime numbers is: \[ \text{LCM}(N_1, N_2) = 945 \] ### Final Answer: The LCM of the two co-prime numbers is **945**.
Promotional Banner

Topper's Solved these Questions

  • INSTALLMENT

    GAGAN PRATAP |Exercise MULTIPLE CHOICE QUESTIONS|29 Videos
  • MIXTURE

    GAGAN PRATAP |Exercise Questions|54 Videos

Similar Questions

Explore conceptually related problems

Product of two co-prime numbers is 117. Then their LCM is:

The LCM of two co-prime numbers is their .

The product of two numbers is 396 xx 576 and their LCM is 6336. Find their HCF:

The product of two numbers is 2560 and their LCM is 320 . Find their HCF.

The product of two numbers is 216. If the HCF is 6, then their LCM is:

GAGAN PRATAP -LCM (LEAST COMMON MULTIPLE)-Multiple Choice Questions
  1. The product of two co-prime numbers is 945 then find their LCM ?

    Text Solution

    |

  2. If 7129p465 is divisible by 9, then the value of p is: यदि 7129p465 ...

    Text Solution

    |

  3. What is the least 5-digit number that is divisible 91? कम से कम 5-अं...

    Text Solution

    |

  4. The largest five-digit number that is exactly divisible by 81 is: पा...

    Text Solution

    |

  5. The least number which is exactly divisible by 5, 6, 8, 10 and 12 is :...

    Text Solution

    |

  6. Find the least perfect square number which is completely divisible by ...

    Text Solution

    |

  7. Let x be the least number divisible by 16, 24, 30, 36 and 45, and x is...

    Text Solution

    |

  8. The greatest number of 5 digits that is exactly divisible by each of 8...

    Text Solution

    |

  9. The least number of 5-digits which exactly divided by 52, 56, 78 and 9...

    Text Solution

    |

  10. The number between 22000 and 23000that is divisible by each of 12,18,2...

    Text Solution

    |

  11. Find the sum of ten's and hundred's place digit of smallest number whi...

    Text Solution

    |

  12. The greatest number of six digits which gives remainder 10 when divide...

    Text Solution

    |

  13. The least number of 5-digits which is divisible by 45, 60, 75 and 120 ...

    Text Solution

    |

  14. Let, x be the smallest number, which when added to 2000 makes the resu...

    Text Solution

    |

  15. If a positive integer .n. is divisible by 3, 5, and 7, then what is th...

    Text Solution

    |

  16. Let x be the least numbers, which when divided by 5, 6, 7 and 8 lea...

    Text Solution

    |

  17. Find the least number which when divided by 12, 18, 24 and 30 leaves 4...

    Text Solution

    |

  18. What is the sum of digit of the least number which when divided by 12,...

    Text Solution

    |

  19. Let x be the least number divisible by 13, such that when x is divide...

    Text Solution

    |

  20. Let x be the least 4-digit number which when divided by 2,3,4,5,6 and ...

    Text Solution

    |