871 and 1742
871 and any multiple of 871
If the two numbers are the same then the GCF is the common value. Otherwise:find the difference between the larger number and the smaller number.replace the larger of the two numbers by this difference.if the two numbers are the same then that is the GCF, but if not go back to step 1.Euclidean AlgorithmIt is not necessary to actually list the factors of all numbers to get the GCF for only two numbers. You can use the Euclidean algorithm.(1) Divide the larger number by the smaller one.(2) If there is no remainder, the GCF is the same as the smaller number.(3) Repeat step 1 with the smaller number and the remainder.Example:GCF of 51 and 85.85/51 = 1 R 3451/34 = 1 R 1734/17 = 2 R 0
gcf(88, 396) = 44 396 ÷ 88 = 4 r 44 88 ÷ 44 = 2 r 0 ⇒ gcf = 44
42 / 18 = 2 r 6 18 / 6 = 3 r 0 -> gcf of 42 and 18 is 6.
1183 / 1001 = 1 r 182 1001 / 182 = 5 r 91 182 / 91 = 2 r 0 GCF of 1183 and 1001 is 91
175 / 80 = 2 r 15 80 / 15 = 3 r 5 15 / 5 = 3 r 0 gcf of 80 and 175 is 5.
Euclidean AlgorithmIt is not necessary to actually list the factors of all numbers to get the GCF for only two numbers. You can use the Euclidean algorithm.(1) Divide the larger number by the smaller one.(2) If there is no remainder, the GCF is the same as the smaller number.(3) Repeat step 1 with the smaller number and the remainder.Example:GCF of 51 and 85.85/51 = 1 R 3451/34 = 1 R 1734/17 = 2 R 0
If the two numbers are the same then the GCF is the common value. Otherwise:find the difference between the larger number and the smaller number.replace the larger of the two numbers by this difference.if the two numbers are the same then that is the GCF, but if not go back to step 1.Euclidean AlgorithmIt is not necessary to actually list the factors of all numbers to get the GCF for only two numbers. You can use the Euclidean algorithm.(1) Divide the larger number by the smaller one.(2) If there is no remainder, the GCF is the same as the smaller number.(3) Repeat step 1 with the smaller number and the remainder.Example:GCF of 51 and 85.85/51 = 1 R 3451/34 = 1 R 1734/17 = 2 R 0
The GCF is 1. The LCM is p x q x r.
To find the greatest common factor between two numbers, we do the following multiple times:(1) Take the remainder of the larger divided by the smaller(2) If there is no remaineder, the smaller is the GCF.(3) Repeat the process with the smaller number and the remainder.Example: GCF of 18 and 10.18/10=1 R 8. So, we take the GCF of 8 and 10.10/8=1 R 2. We take the GCF of 2 and 8.8/2=4 R 0. By rule #2, 2 is our GCF.Lets use 85 and 51.85/51=1 R 3451/34=1 R 1734/17=2 R 0.Our answer is 17.------------------------------------------------------------------------------------------------Or an easier way to do it is factor trees. 51 85^ ^5 17 3 17The numbers cannot be simplified any more, so there fore the GCF is 17.Factors of 85:1,5,17,51Factors of 51:1,3,17,51Therefore, the greatest common factor is 17.It is: 17
OOH! This is what I have for homework tonight. :) so, the prime factorisation for 8r3 (im asuming that it is 8r to the 3rd) is: 2,2,2,r,r,r and 2r2 is: 2,r,r. so the similar numbers are 2,r,r. So your answer is 2r2 (2r squared)
168 / 70 = 2 r 28 70 / 28 = 2 r 14 28 / 14 = 2 r 0 gcf of 70 and 168 is 14.
99 / 72 = 1 r 27 72 / 27 = 2 r 18 27 / 18 = 1 r 9 18 / 9 = 2 r 0 GCF of 72 and 99 is 9
gcf(88, 396) = 44 396 ÷ 88 = 4 r 44 88 ÷ 44 = 2 r 0 ⇒ gcf = 44
152 / 56 = 2 r 40 56 / 40 = 1 r 16 40 / 16 = 2 r 8 16 / 8 = 2 r 0 GCF of 56 and 152 is 8.
42 / 18 = 2 r 6 18 / 6 = 3 r 0 -> gcf of 42 and 18 is 6.
The greatest common factor (GCF) of 42 and 63 is 21.To find the GCF (greatest common factor) of two numbers, first prime factorize them.42 = 2*3*763 = 3*3*7The GCF must be able to contain factors such that if divided by 42 or 63, the answer will be an integer.The GCF is 21.21
175 / 80 = 2 r 15 80 / 15 = 3 r 5 15 / 5 = 3 r 0 gcf of 80 and 175 is 5.