Want this question answered?
46.
It is: 46
742/105 = 7 remainder 7 1162/105 = 11 remainder 7
The GCF (Greatest Common Factor) of m and n is the largest positive integer that divides both m and n without leaving a remainder.
23.............
There is no such number. 1675 - 6 = 1669 which is a prime. As a result, the only number that can divide it is 1 and 1669 itself. However, 1 not only divides 1669 but it also divides 1675. That is, 1 does not leave a remainder of 6 when dividing 1675.
46.
It is: 46
742/105 = 7 remainder 7 1162/105 = 11 remainder 7
1
The GCF (Greatest Common Factor) of m and n is the largest positive integer that divides both m and n without leaving a remainder.
10698 ÷ gcf = n remainder 18 → gcf divides 10698 - 18 = 106806443 ÷ gcf = m remainder 35 → gcf divides 6443 - 35 = 640814995 ÷ gcf = k remainder 43 → gcf divides 14995 - 43 = 14952Therefore want gcf(10680, 6408, 14952) = 2136.Using prime factorization method:10680 = 2³ x 3 x 5 x 896408 = 2³ x 3² x 8914952 = 2³ x 3 x 7 x 89hcf = 2³ x 3 x 89 = 2136
... is a "factor" of the given number.
23.............
As 16 divides equally by 2 without leaving a remainder, it is indeed an even number.
The greatest possible remainder for 76 is to be divided by 2 leaving the result of 38. Thank you!
A remainder of zero is obtained whenever the number is divided by its factor. For example, when 20 is divided by either 1,2,4,5,10 or 20 the remainder is zero. Every number has 1 as its divisor.Infact, this is the definition of divisor- a number which divides another number to return zero as the remainder.