numere-prime
.ro
Language
Deutsch
English
Español
Français
Italiano
Română
Menu
factorizing
gcf, gcd
lcm
fractions
divisibility
1 - 10000
Eratosthenes
Euclid
How is ordinary fraction reduced (simplified):
30 / 48?
Reduce (simplify) ordinary fraction to lowest terms:
30 / 48 = ?
a / b = (a : gcf (a, b)) / (b : gcf (a, b))
30 / 48 =
(2 * 3 * 5) / (2
^{4}
* 3) =
((2 * 3 * 5) : (2 * 3)) / ((2
^{4}
* 3) : (2 * 3)) =
(30 : 6) / (48 : 6) =
5 / 8
Your browser does not support in-line iframes. Please enter this link:
here
Latest ordinary fractions reduced to lowest terms (simplified)
18 / 45 = (18 : 9) / (45 : 9) =
2 / 5
Sep-01 15:07
72 / 11 already reduced (simplified) to lowest terms
improper fraction: 72 / 11
rewrite:
72 : 11 = 6 and remainder = 6 =>
72 / 11 =
(6 * 11 + 6) / 11 =
6 +
^{6}
/
_{11}
=
mixed fraction: 6
^{6}
/
_{11}
Sep-01 15:06
55 / 132 = (55 : 11) / (132 : 11) =
5 / 12
Sep-01 15:06
12 / 40 = (12 : 4) / (40 : 4) =
3 / 10
Sep-01 15:06
4 / 38 = (4 : 2) / (38 : 2) =
2 / 19
Sep-01 15:05
24 / 102 = (24 : 6) / (102 : 6) =
4 / 17
Sep-01 15:05
10 / 32 = (10 : 2) / (32 : 2) =
5 / 16
Sep-01 15:04
65 / 51 already reduced (simplified) to lowest terms
improper fraction: 65 / 51
rewrite:
65 : 51 = 1 and remainder = 14 =>
65 / 51 =
(1 * 51 + 14) / 51 =
1 +
^{14}
/
_{51}
=
mixed fraction: 1
^{14}
/
_{51}
Sep-01 15:04
8 / 30 = (8 : 2) / (30 : 2) =
4 / 15
Sep-01 15:04
39 / 78 = (39 : 39) / (78 : 39) =
1 / 2
Sep-01 15:04
22 / 15 already reduced (simplified) to lowest terms
improper fraction: 22 / 15
rewrite:
22 : 15 = 1 and remainder = 7 =>
22 / 15 =
(1 * 15 + 7) / 15 =
1 +
^{7}
/
_{15}
=
mixed fraction: 1
^{7}
/
_{15}
Sep-01 15:03
26 / 65 = (26 : 13) / (65 : 13) =
2 / 5
Sep-01 15:02
40 / 64 = (40 : 8) / (64 : 8) =
5 / 8
Sep-01 15:02
Ordinary fractions reduced to lowest terms (simplified) by users, list