1 and 17
You start by "prime factorizing" one of the numbers. It doesn't matter which one ( or, at least, unless you've done factoring for a while). We'll factorize 68, because it's even and thus we know it's divisible by 2.
68/2 = 34
34/2 = 17
Thus, 68 can be rewritten as a product of 2 * 2 * 17.
Now, 51 is an odd number, so it can't have 2 as a factor. By process of elimination, the factor must be 17, right?! Wrong! 1 could be the only factor the two have in common (which reminds me, you can probably write "1" for this problem!). But anyways, we should check 17:
51/17 = 3 with 0 remainder.
17 is a factor of 51, and we've determined it's also a factor of 68 from above. Thus it's a factor of both.
The GCF is 17.
Factors: 1 and 17 Multiples: 17, 34, 51, 68 and so on.
Since 17 is a factor of 68, it is automatically the GCF.
A multiple of any number is the number times the given number it is to be multiplied by. Example, the first multiple of 17 is 34, (17x2=34) The second multiple is 51, (17x3=51), the third is 68, (17x4=68) and so on. So, 17 times anything will equate to a multiple of 17 because it can be divided back the same number of times to become 17 again.
68 / \ 2x34 / \ 2x17
The common factors of 51 and 68 are 1 and 17.
First, determine the greatest common factor of 51 and 68, which is 17. Then, divide both the numerator and the denominator by 17. 51/68 ÷ 17/17 = 3/4
17
75 68% of 75 is 51. Assuming X is the parent number. X * 0.68 = 51 X = 51 / 0.68 = 75
The greatest common factor (GCF) is: 17
The GCF is 17.
The GCF is 17.
factors of 51: 1, 3, 17, 51factors of 68:1, 2, 4, 17, 34, 68GCF: 17
51/68 is equal to 3/4. In general, to reduce a fraction, you have to find the largest number which divides both the top and the bottom, called the Greatest Common Factor (GCF) or Greatest Common Divisor (GCD). In many cases, you can do this by simple observation, but sometimes, as here, the GCD is not obvious -- most people don't know the multiples of 17 off the top of their head. If the GCD isn't readily apparent, the straightforward thing to do is to try to find all the factors of both numbers. By trial division, you'll find that 3 divides 51, so 51 is 3*17, where 17 is prime and can't be broken up further. 68 is even so we write it as 2*34; 34 is also even, and is 2*17, so 68 is 2*2*17. The only prime factor in common is 17, so this is the GCF. A far easier way (for large numbers you wouldn't want to factor) is Euclid's Algorithm, which relies on the observation that if a number divides A and B, it will also divide their difference A-B. So we can make the problem simpler by subtracting the smaller number from the larger. Observe how this works in our case: we start off with 51 and 68. 68 is the larger, so we replace it by 68-51, which is 17. Now our problem is to find the GCD of 17 and 51. Subtract 17 from 51 to get 34, and then 17 from 34 to get 17. Now the answer is obvious: the largest number that divides both 17 and 17 is 17 itself. Whichever way you found the GCD, the thing to do is to cancel it from the top and the bottom. 51 becomes 51/17 or 3, and 68 becomes 68/17 or 4, so 51/68=3/4.
1 and 17
1 and 17
68 34,2 17,2,2