Decimal to Fraction
I've created a Fraction class that will take a double in the constructor and transform it into a printable fraction. I've got everything working fine except for repeating fractions like 1/3. I know I need to change the code for my Fraction constructor (using doubles), but I'm not sure how.
Here is my fraction class:
public class Fraction
public Fraction (double doubleFraction)
public Fraction (int numerator, int denominator)
private void gcd (int numerator, int denominator)
for(int x = highest;x>0;x--)
if (denominator%x==0 && numerator%x==0)
public String getFraction()
if (this.n == this.d)
return("" + 1);
else if (this.d > this.n)
return (this.n + "/" + this.d);
Fraction test = new Fraction(this.n,this.d);
wholeNumber = (int)(test.n/test.d);
return (wholeNumber + " " + test.n + "/" + test.d);
Thanks for any help.
Last edited by evenflow58; 12-15-2005 at 10:57 PM.
1-)rational numbers may include infinite-long decimal part.
( example 1/3 ..)
and they should have a repeat pattern.
( 22/ 7 = 3.142857142857142857142857... )
2-) if we know the fraction we can find repeating part exactly.
but if we have a number with infinite-long decimal part
( should be represented using finite-precision )
we can not say exactly which is the fraction.
( each precision level may give another fraction )
in math that numbers have infinite-long decimal part.
( but inside computer they are limited ofcourse )
you work finite-long precision ( 1/100 precision ).
( but you work less precision level than java )
so , dont expect to work in java-level-precision .
forexample if you work with 1/10000 precision :
number format will be 0.xyzt
for 0.xyxy you may say xy repeating part
but this number may be 0.xyxyzxyxyz as a java double value.
-decide wich level precision you want to work .
-find the longest repeated pattern in decimal part.
- use this trick :
0.xxxxxx ===> x / 9 ( x != 9 )
0.xyxyxy ===> xy / 99 ( x != 99 )
0.xyzxyz ===> xyz / 999 ( x != 999 )
0.99999 =====> 1
Hey, i need help converting decimals to fractions in java. could you post your revised program with the fixed errors? or can someone else revise it casuse i dont get how to fix it
plz help ,Daminan_Sotd
Last edited by Daminan_sotd; 11-02-2006 at 09:42 PM.
Have you thought about having a lookup table for the common "infinitely repeating" decimals? Your logic could determine whether you have gone to 5(?) or 10(?) decimal places and you haven't resolved, then look up the pattern and report the fraction which follows that pattern.
For the infinitely-long non-resolving fractions, it looks like mr1yh1's suggestion will work well.
but how do you you make java recognise diffrent patterns like .333333333 and .16666666 ???
Read the digits after the decimal as an int and use a switch structure. Take a look at
for performing modulus on a floating point number
Last edited by nspils; 11-05-2006 at 01:18 PM.
By malehda3y in forum C++
Last Post: 12-03-2005, 02:35 PM
By Villy Olsson in forum Database
Last Post: 04-06-2002, 08:01 PM
By Peter Farthofer in forum VB Classic
Last Post: 09-26-2001, 06:08 PM
By curtis king in forum Database
Last Post: 02-25-2001, 12:58 PM
By Dante in forum VB Classic
Last Post: 06-23-2000, 02:45 AM
-- Android Development Center
-- Cloud Development Project Center
-- HTML5 Development Center
-- Windows Mobile Development Center