0
Find the greatest number that divides 364 414 and 539 with the same remainder in each case?
Wiki User
∙ 10y ago
360
Wiki User
∙ 10y ago
Add your answer:
Earn +20 pts
Find the greatest number which divides 742 and 1162 leaves a remainder of exactly 7 in each case?
This is a slight twist to the normal find the GCF of two numbers. In this case as a remainder of 7 is required, subtracting 7 from each number and then finding the GCF of the resulting numbers will solve the problem: 742 - 7 = 735 1162 - 7 = 1155 GCF of 1155 and 735 (using Euclid's method): 1155 / 735 = 1 r 420 735 / 420 = 1 r 315 420 / 315 = 1 r 105 315 / 105 = 3 r 0 GCF of 735 & 1155 is 105, thus 105 is the greatest number that will divide 742 and 1162 leaving a remainder of exactly 7 each time.
Find the greatest number which divides 285 and 1249 leaving remainders 9 and 7 respectively?
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.
Find the greatest number which divides 6168 2447 and 3118 leaving the same remainder in each case?
The greatest such number is 1. If n is such a number, then 6168 = an + r 2447 = bn + r, and 3118 = cn + r for some integers a, b, c and r. This means that 6168 - 2447 = 3721 = (a-b)n 6168 - 3118 = 3050 = (a-c)n, and 3118 - 2447 = 671 = (c-b)n That is, n is the greatest common factor of 3721, 3050 and 671. But the GCF of these numbers is 1. Hence the answer.
What is the greatest 4 digit number which is exactly divisible by 40 48 and 60?
First we need to find the L.C.M. of 40, 48 and 60. 40 = 2x2x2x5 48 = 2x2x2x2x3 60 = 2x2x3x5 After taking out common factors, we have L.C.M. = 2x2x2x3x5x2 = 240 To find the greatest 4 digit number which is divisible by 240 we divide 9999 by 240. Remainder = 159 Subtracting this remainder from 9999 we get 9999 - 159 = 9840. So, the required answer is 9840.
Find the smallest number that meets all of these conditions divide the number by 5 remainder 3 divide the number by 8 remainder 2 divide the number by 9 remainder 4?
58
Find the greatest number which divides 742 and 1162 leaving 7 as remainder in each case?
742/105 = 7 remainder 7 1162/105 = 11 remainder 7
Find the greatest number which divides 742 and 1162 leaves a remainder of exactly 7 in each case?
This is a slight twist to the normal find the GCF of two numbers. In this case as a remainder of 7 is required, subtracting 7 from each number and then finding the GCF of the resulting numbers will solve the problem: 742 - 7 = 735 1162 - 7 = 1155 GCF of 1155 and 735 (using Euclid's method): 1155 / 735 = 1 r 420 735 / 420 = 1 r 315 420 / 315 = 1 r 105 315 / 105 = 3 r 0 GCF of 735 & 1155 is 105, thus 105 is the greatest number that will divide 742 and 1162 leaving a remainder of exactly 7 each time.
How do you make a program to check remainder is zero or not inGW-BASIC?
So you have a number - "Number" and you need to find if the remainder of dividing it by a number is 0. Number = 3 If Number Mod 2 = 0 then Msgbox("Remainder of 0") End If This function divides by 2 then gives the remainder, this let's you check if a number is odd or even.
Find the greatest number which divides 285 and 1249 leaving remainders 9 and 7 respectively?
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.
What is the least common multiple of 20 and 34?
Expressing each number as the product of prime numbers can help a lot.First of all, we will find the greatest number which divides both number and then it is multiplied with other numbers in prime factorization of 34 and 20.Here the greatest number which divides both is 2.34: 2x17 and 20: 2x2x5L.C.M. = 2x17x2x5 = 34x10 = 340
Find the greatest number which divides 6168 2447 and 3118 leaving the same remainder in each case?
The greatest such number is 1. If n is such a number, then 6168 = an + r 2447 = bn + r, and 3118 = cn + r for some integers a, b, c and r. This means that 6168 - 2447 = 3721 = (a-b)n 6168 - 3118 = 3050 = (a-c)n, and 3118 - 2447 = 671 = (c-b)n That is, n is the greatest common factor of 3721, 3050 and 671. But the GCF of these numbers is 1. Hence the answer.
What is the greatest common multiple of 12 and 72?
There is no greatest common multiple of any set of numbers. Whatever number you say is their greatest common multiple, I can add their lowest common multiple and get an even greater number.I suspect you want one of:Greatest Common Factor (the highest (positive) number that divides into both without any remainder): GCF(72, 12) = 12Lowest Common Multiple (the lowest (positive) number that is a multiple of both, that is they both divide into without any remainder); LCM(72, 12) = 72
Why is the greatest common factor of 20 and 100 20?
Since 20 is a factor of 60, it is automatically the GCF. You can't find a factor of 20 larger than 20.
How do you find a greatest number of a number?
Which number is greatest?0.0990.2920.3810.413
What is greatest common factor and how do you find it?
Greatest common factor (GCM) is the largest number that divides into 2 or more numbers. For example: The GCM for 12 and 18 is 6. There are many ways to find the GCM. Here are ways you can find the GCM:Inverted DivisionList out all the factors of both of the numbers
What is the greatest 4 digit number which is exactly divisible by 40 48 and 60?
First we need to find the L.C.M. of 40, 48 and 60. 40 = 2x2x2x5 48 = 2x2x2x2x3 60 = 2x2x3x5 After taking out common factors, we have L.C.M. = 2x2x2x3x5x2 = 240 To find the greatest 4 digit number which is divisible by 240 we divide 9999 by 240. Remainder = 159 Subtracting this remainder from 9999 we get 9999 - 159 = 9840. So, the required answer is 9840.
How do you find the remainder?
This means you divide a number and whatever you have left over is your remainder,
