19392 = 2 x 2 x 2 x 2 x 2 x 2 x 3 x 101;
43008 = 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2 x 3 x 7
HCF = 26 x 3 = 192
19409 / 192 = 101 rem 17
43037 / 192 = 224 rem 29
4
138. What is required is the largest number n such that: 285 = jn + 9 1249 = kn + 7 So subtract the required remainders and then find the hcf of the results: 285 - 9 = 276 1249 - 7 = 1242 Find hcf of 276 and 1242: 1242 / 276 = 4 r 138 276 / 138 = 2 r 0 hcf of 276 and 1242 is 138. Thus 138 is the largest number to divide 285 with a remainder of 9 and divides 1249 with a remainder of 7.
17,303
23.25
Itself and any of its factors will divide evenly into -72 with no remainders.
It is 1 because it is the highest number that will divide evenly into both numbers leaving no remainders
The GCF is 15 because it is the highest number that will divide exactly into 135 and 120 leaving no remainders.
Factors are whole numbers that will divide into other whole numbers leaving no remainders
It is 12 because 12 is the highest common factor of both number that will divide into them evenly and leaving no remainders.
It is 34 because 34 is the largest number that will divide evenly into 1020 and 11594 leaving no remainders
The GCF of both numbers is 2 because it is the biggest number that will divide evenly into both numbers leaving no remainders.
5
0.5
2, 1 or 0.
138. What is required is the largest number n such that: 285 = jn + 9 1249 = kn + 7 So subtract the required remainders and then find the hcf of the results: 285 - 9 = 276 1249 - 7 = 1242 Find hcf of 276 and 1242: 1242 / 276 = 4 r 138 276 / 138 = 2 r 0 hcf of 276 and 1242 is 138. Thus 138 is the largest number to divide 285 with a remainder of 9 and divides 1249 with a remainder of 7.
4
The greatest common factor between 504 and 336 is 168. You would find this by listing all the factors of 504 and 336 and choosing the highest one that would divide them evenly with no remainders.