Assuming you're trying to find the LCM - the least common multiple - the rigorous way to do this is by Euclid's algorithm, which says:
A*B = GCD(A,B)*LCM(A,B), where GCD(A,B) is the greatest common divisor (factor) of A and B. Euclid has an algorith for computing this, which is: GCD(A,B) = { GCD(B, A modulo B), or A if B is zero }. (modulo means the remainder from division, i.e., 16 modulo 5 is 1, because 16/5 = 3 remainder 1). But never mind that, we can do it much more simply: we can ignore 1, everything is a multiple of 1. We can ignore 2 & 4 - everything that's a multiple of 8 will be a multiple of 2 and 4. We can ignore 3 and 6 - everything that's a multiple of 9 and 8 will be a multiple of 3 and 6. We keep 5, 7, 8 and 9. We can ignore 10 - everything that's a multiple of 5 and 2 should be a multiple of 10. So our number is 5*7*8*9, 2520.
2006-09-22 18:50:37
·
answer #1
·
answered by astazangasta 5
·
3⤊
0⤋
The LCM is 2520
Least common Multiple is derived by excluding all common factors among 2 or more numbers and then finding out the product of the given numbers.
In the given instance, 2520 is the answer being product of
5, 7, 8 and 9
2006-09-23 01:55:08
·
answer #2
·
answered by small 7
·
2⤊
0⤋
The lowest number that is divisible by these numbers is LCM(1,2,3,4,5,6,7,8,9,10)
= 2520
2006-09-23 03:34:02
·
answer #3
·
answered by Mein Hoon Na 7
·
1⤊
1⤋
1 : 1
2 : 2
3 : 3
4 : 2 * 2
5 : 5
6 : 2 * 3
7 : 7
8 : 2 * 2 * 2
9 : 3 * 3
10 : 2 * 5
1 * 2 * 3 * 2 * 5 * 2 * 3 * 7 = 2520
2006-09-23 02:12:43
·
answer #4
·
answered by Sherman81 6
·
2⤊
0⤋
the correct answer is 0. because 0 is the lowest number that there is
2006-09-23 01:45:38
·
answer #5
·
answered by soar_2307 7
·
0⤊
4⤋
2520
2006-09-23 01:45:12
·
answer #6
·
answered by Farshad 2
·
3⤊
0⤋
r u looking for the LCM?
2006-09-23 01:44:44
·
answer #7
·
answered by ok 4
·
0⤊
3⤋
i tink the number is----o[zero]
2006-09-23 01:35:57
·
answer #8
·
answered by monikaa_das d 1
·
0⤊
4⤋