fractions

I'd like to be able to write a fraction using HTML/CSS/jQuery (rather than using a TeX renderer or even MathML). At the moment there's a great workaround for writing simple fractions that works if you just have one term for both the numerator and the denominator, but once you start using more than one term it looks rather horrible. As an example, using: ^{<font size=-2>x² + 3x + 5</font>}/_{<font size=-2>2x</font>} produces... x 2 + 3x + 5 / 2x What I'd like is a beautiful horizontal line to define the fraction rather than a backslash. I've tried using div tags with

I have a value returned as a number, with could be decimal number e.g. "1.15". However, I need to format all numbers in a range to a given fraction. For example, all numbers greater than 0 but less than .2 I want to return "1/8". I already started to do this as a series of if/else statements, but I was wondering if there was a smarter and neater way. if (amt > 0 && amt <= .2){ q = '1/8'; } else if (amt > .2 && amt <= .3){ q = '1/4'; } else if (amt > .3 && amt <= .4){ q = '1/3'; } else if (amt > .4 && amt <= .5){ q = '1/2'; } else if (amt > .5 && amt <= .7){ q = '2/3'; } else if (amt > .7 &&

Rather than converting an arbitrary decimal to an exact fraction (something like 323527/4362363), I am trying to convert to just common easily-discernible (in terms of human-readability) quantities like 1/2, 1/4, 1/8 etc. Other than using a series of if-then, less than/equal to etc comparisons, are there more optimized techniques to do this? Edit: In my particular case, approximations are acceptable. The idea is that 0.251243 ~ 0.25 = 1/4 - in my usage case, that's "good enough", with the latter more preferable for human readability in terms of a quick indicator (not used for calculation, just

The ancient Egyptians only used fractions of the form 1/n so any other fraction had to be represented as a sum of such unit fractions and, furthermore, all the unit fractions were different! What is a good method to make any fraction an egyptian fraction (the less sums better) in C or java, what algorithm can be used, branch and bound, a*? for example: 3/4 = 1/2 + 1/4 6/7 = 1/2 + 1/3 + 1/42 One way is the greedy algorithm. Given the fraction f , find the largest Egyptian fraction 1/n less than or equal to f (i.e., n = ceil(1/f)). Then repeat for the remainder f - 1/n , until f == 0 . So for 3

Let us suppose that we have a string representing a binary fraction such as: ".1" As a decimal number this is 0.5. Is there a standard way in Python to go from such strings to a number type (whether it is binary or decimal is not strictly important). For an integer, the solution is straightforward: int("101", 2) >>>5 int() takes an optional second argument to provide the base, but float() does not. I am looking for something functionally equivalent (I think) to this: def frac_bin_str_to_float(num): """Assuming num to be a string representing the fractional part of a binary number with no

I'm using the fractions module in Python v3.1 to compute the greatest common divisor. I would like to know what algorithm is used. I'm guessing the Euclidean method, but would like to be sure. The docs ( http://docs.python.org/py3k/library/fractions.html?highlight=fractions.gcd#fractions.gcd ) don't help. Can anybody clue me in? According to the 3.1.2 source code online , here's gcd as defined in Python-3.1.2/Lib/fractions.py : def gcd(a, b): """Calculate the Greatest Common Divisor of a and b. Unless b==0, the result will have the same sign as b (so that when b is divided by it, the result