What is the greatest number which divides 285 and 1249 leaving remaind...
To find the greatest number that divides both 285 and 1249 with remainders of 9 and 7 respectively, we need to find the common factors of the two numbers.
Factors of 285: 1, 3, 5, 9, 15, 19, 45, 57, 95, 171, 285
Factors of 1249: 1, 7, 89, 623, 1249
We can see that 1 is a common factor of both numbers, but we need to find the greatest common factor (GCF). To do this, we look for the highest common factor that divides both numbers without leaving a remainder.
From the given information, we can see that the GCF must be a factor of (285 - 9) and (1249 - 7), which gives us (276 and 1242).
Now, let's find the GCF of 276 and 1242.
- Identify the factors of 276: 1, 2, 3, 4, 6, 12, 23, 46, 69, 92, 138, 276
- Identify the factors of 1242: 1, 2, 3, 6, 7, 14, 21, 42, 29, 58, 87, 174, 249, 498, 747, 1242
From the above lists, we can see that the highest common factor of 276 and 1242 is 138.
Therefore, the greatest number that divides both 285 and 1249 with remainders of 9 and 7 respectively is 138.