You see that both numbers end with an even number and divide by 2 … 8 times. 2 is one of the easiest common divisors to find. Along with /10 if both end with 0 or /5 if one ends 5 and the other 5 or 0. In this case it’s a lucky example, usually you don’t find the GCD with just dividing by 2. But you actually only asked about common divisors and you can see 2, 5 and 10 in decimal
I love reducing fractions, because I’m way too lazy to do mental calculations with big numbers. You can reduce in multiple steps.
I was even so lazy to first write 3.5 3.5 2 0.5 2 2 / 2 1.5 2.5 1 = 1.5 4 3.5 0 3.5 1 / 1 0.5 3.5 3 … (then wrote it without the space, but then you have to know that .NM has to be replaced with N+M; it was less to type). I only did the last step fully in my head
There’s a very old math algorithm called Euclid’s Algorithm that lets you slowly work your way down to the greatest common factor between two numbers regardless of size. It’s quite simple but requires a lot of subtraction.
How the hell does a human and/or calculator find the common divisor??
You see that both numbers end with an even number and divide by 2 … 8 times. 2 is one of the easiest common divisors to find. Along with /10 if both end with 0 or /5 if one ends 5 and the other 5 or 0. In this case it’s a lucky example, usually you don’t find the GCD with just dividing by 2. But you actually only asked about common divisors and you can see 2, 5 and 10 in decimal
I love reducing fractions, because I’m way too lazy to do mental calculations with big numbers. You can reduce in multiple steps.
774144/4352=387072/2176=193536/1088=96768/544=48384/272=24192/136=12096/68=6048/34=3024/17
I was even so lazy to first write 3.5 3.5 2 0.5 2 2 / 2 1.5 2.5 1 = 1.5 4 3.5 0 3.5 1 / 1 0.5 3.5 3 … (then wrote it without the space, but then you have to know that .NM has to be replaced with N+M; it was less to type). I only did the last step fully in my head
That’s so cool! Thanks for helping me! I can barely mimic a fraction
There’s a very old math algorithm called Euclid’s Algorithm that lets you slowly work your way down to the greatest common factor between two numbers regardless of size. It’s quite simple but requires a lot of subtraction.
https://www.mathsisfun.com/numbers/common-denominator.html
Also
https://www.mathsisfun.com/least-common-denominator.html
Math is hard lol
Euclid’s Algorithm.