programming question! Options

[pebkac]

Ok, so I'm taking Desrosiers (yeah, he sucks) for CS 1412 and I'm working on a programming assignment right now (in C#).

What I basically have to do is create a class that stores a fraction. One of the things it's supposed to do is take a floating point number and convert that to a fraction. What my class basically does is round the floating point number to 5 decimal places, then multiplies it by 100,000. It then uses the resulting integer as the numerator and 100,000 as the denominator and simplifies that.

That works fine for the most part, but what I would also like to be able to do is have it recognize .33333 as 1/3, .66667 as 2/3, 1.33333 as 4/3, etc.

I can take the modulus of the floating point number and see if the remainder is zero, but I think that way would be really prone to rounding errors.

I don't necessarily have to implement that (he said that the method can have limitations as long as we document them), but it would be nice if I could do that. Does anyone have any advice?

[Spectatrix]

Oh here we go, better example (scroll to the bottom): http://math2.org/math/general/arithmetic/fradec.htm

Need to convert a repeating decimal to a fraction? Follow these examples:
Note the following pattern for repeating decimals:
0.22222222... = 2/9
0.54545454... = 54/99
0.298298298... = 298/999
Division by 9's causes the repeating pattern.

Note the pattern if zeros preceed the repeating decimal:
0.022222222... = 2/90
0.00054545454... = 54/99000
0.00298298298... = 298/99900
Adding zero's to the denominator adds zero's before the repeating decimal.

To convert a decimal that begins with a non-repeating part, such as 0.21456456456456456..., to a fraction, write it as the sum of the non-repeating part and the repeating part.
0.21 + 0.00456456456456456...
Next, convert each of these decimals to fractions. The first decimal has a divisor of power ten. The second decimal (which repeats) is convirted according to the pattern given above.
21/100 + 456/99900
Now add these fraction by expressing both with a common divisor
20979/99900 + 456/99900
and add.
21435/99900
Finally simplify it to lowest terms
1429/6660
and check on your calculator or with long division.
= 0.2145645645...

This post has been edited by Spectatrix: Feb 1 2008, 03:14 PM

[pebkac]

Oh here we go, better example (scroll to the bottom): http://math2.org/math/general/arithmetic/fradec.htm

This is all well and good, but first I have to get the program to recognize that the number is repeating. I could probably analyze the number digit by digit, but as this isn't the primary focus of the project, I don't want to go into that much depth. I could also see if the remainder is 0 if I divide by a set group of integers, but that may not be of much help as there will probably be a significant number of rounding errors.

[blaarg]

This is all well and good, but first I have to get the program to recognize that the number is repeating.

That's easy to do with a loop depending on how you handle the number.
shrug*

Also, regarding the repeating number bit, you should make it an array, then, and do some fancy array manipulation.

this is what I mean when I say "depending on how you handle the number"