numere-prime
.ro
Language
Deutsch
English
Español
Français
Italiano
Română
Menu
factorizing
gcf, gcd
lcm
fractions
divisibility
divisors
1 - 10000
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)
748 / 5 already reduced (simplified) to lowest terms
improper fraction: 748 / 5
rewrite:
748 : 5 = 149 and remainder = 3 =>
748 / 5 =
(149 * 5 + 3) / 5 =
149 +
^{3}
/
_{5}
=
mixed fraction: 149
^{3}
/
_{5}
Feb-13 08:44
33 / 18 = (33 : 3) / (18 : 3) =
improper fraction: 11 / 6
rewrite:
11 : 6 = 1 and remainder = 5 =>
11 / 6 =
(1 * 6 + 5) / 6 =
1 +
^{5}
/
_{6}
=
mixed fraction: 1
^{5}
/
_{6}
Feb-13 08:39
4 / 7 already reduced (simplified) to lowest terms
Feb-13 08:33
91 / 105 = (91 : 7) / (105 : 7) =
13 / 15
Feb-13 08:18
44 / 60 = (44 : 4) / (60 : 4) =
11 / 15
Feb-13 08:16
930 / 1 512 = (930 : 6) / (1 512 : 6) =
155 / 252
Feb-13 08:15
36 / 54 = (36 : 18) / (54 : 18) =
2 / 3
Feb-13 08:15
19 / 56 already reduced (simplified) to lowest terms
Feb-13 08:12
49 / 30 already reduced (simplified) to lowest terms
improper fraction: 49 / 30
rewrite:
49 : 30 = 1 and remainder = 19 =>
49 / 30 =
(1 * 30 + 19) / 30 =
1 +
^{19}
/
_{30}
=
mixed fraction: 1
^{19}
/
_{30}
Feb-13 08:09
24 / 100 = (24 : 4) / (100 : 4) =
6 / 25
Feb-13 08:07
24 / 100 = (24 : 4) / (100 : 4) =
6 / 25
Feb-13 08:07
91 / 75 already reduced (simplified) to lowest terms
improper fraction: 91 / 75
rewrite:
91 : 75 = 1 and remainder = 16 =>
91 / 75 =
(1 * 75 + 16) / 75 =
1 +
^{16}
/
_{75}
=
mixed fraction: 1
^{16}
/
_{75}
Feb-13 08:06
6 / 25 already reduced (simplified) to lowest terms
Feb-13 08:06
Ordinary fractions reduced to lowest terms (simplified) by users, list