Find the largest number that divides 280 and 490 without leaving a remainder.
Find the largest number that divides 280 and 490 without leaving a remainder.
Solution:
280 = 2 x 2 x 2 x 5 x 7
490 = 2 x 5 x 7 x 7
The largest number that divides 280 and 490 without leaving a remainder is their HCF
HCF of 280 and 490 = 2 x 5 x 7 = 70
Related Articles
- Find the largest number which exactly divides 280 and 1245 leaving remainders 4 and 3, respectively.
- Find the largest number which divides 615 and 963 leaving remainder 6 in each case.
- Find the greatest number which divides 2011 and 2623 leaving remainder 9 and 5.
- Find the greatest number that divides 57, 133 and 384, leaving 7, 8 and 9 respectively as remainder
- Find the greatest number which divides 615 and 963, leaving remainder 6 in each case
- Find the greatest number which divides 38, 47 and 76 leaving remainder 3, 2 and 1 respectively.
- Find the largest number that will divide 397, 435, 541 leaving remainder 6, 10, 14, respectively. Solve it.
- Using Euclid's division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3 respectively.
- Find the greatest number which divides 285 and 1249 leaving remainders 9 and 7 respectively.
- Find the greatest number which divides 2011 and 2623 leaving remainders 9 and 5 respectively.
- The largest number which divides 70 and 125, leaving remainders 5 and 8, respectively, is(A) 13(B) 65(C) 875(D) 1750
- Find the greatest number that exactly divides 289 and 391.
- Find a number that divides maximum array elements in C++
- Digital Footprint Management: Leaving Your Mark Without Leaving a Trace
- Find maximum power of a number that divides a factorial in C++
Kickstart Your Career
Get certified by completing the course
Get Started