A shopkeeper hqs 3 bundles of string 392m,308m,490m .what is the greatest length of string that the bundles can be cut up into without any left over string
Answers
Answered by
1
Step-by-step explanation:
it means we need to find the hcf of 392,308,490
Answered by
3
The greatest length of string possible =
HCF(392, 308, 490)
HCF= ?
392 = 7²×2³
308 = 7×11×2²
490= 7²×2×5
=> HCF = 7×2 m
=14 m
Similar questions
Computer Science,
6 months ago
Science,
6 months ago
Science,
6 months ago
Chemistry,
1 year ago
Biology,
1 year ago
Chemistry,
1 year ago
Environmental Sciences,
1 year ago