48 divided into 1218 = 0.03940886699507389
Suppose you want to find the gcf of 5040 and 1274. Make a list or a "ladder" starting with 5040 and 1274. Each item after that is the remainder of dividing the two numbers above. 5040 1274 1218 (5040 divided by 1274 leaves a remainder of 1218) 56 (1274 divided by 1218 leaves a remainder of 56) 42 (1218 divided by 56 leaves a remainder of 42) 14 (56 divided by 42 leaves a remainder of 14) 0 (42 divided by 14 leaves a remainder of 0). When you reach zero, the number before it (in this case 14) is the gcf. The gcf of 5040 and 1274 is 14. In general: Let a and b be the two numbers. repeat while (b >0) Let c = the remainder of a divided by b Let a=b Let b=c The gcf is a.
0.0296
29
59
2
0.0328
3.5
179 works until divided by 7 the remainder is 6. 2519 works till 10....
58
To find the remainder of 608 divided by 6, we first divide 608 by 6, which equals 101 with a remainder of 2. Therefore, the remainder of 608 divided by 6 is 2.
6.25