I've written a simple code: sub euler-ex ($x) of Seq { 1, { $x**++$ / [×] 1 .. ++$ } ... Inf } say " 5: " ~ euler-ex(5)[^20] ~ " = " ~ [+](euler-ex(5)[^20]); The output: 5: 1 ...

I would like to get an elegant code, which removes the insignificant closing zeroes, eg: 29.970 => 29.97 29.97 => 29.97 25.00 => 25 25.0 => 25 I tried: argument.to_r.to_f.to_s But...

I am looking for an algorithm to convert a float to a rational number, such that the rational number is guaranteed to evaluate back to the original float, and the denominator is minimized. A naive ...

I'm looking for a method to convert the exact value of a floating-point number to a rational quotient of two integers, i.e. a / b, where b is not larger than a specified maximum denominator b_max. ...

I'd like to test the value of an enumeration attribute of a DOORs object. How can this be done? And where can I find a DXL documentation describing basic features like this? if (o."Progress" == 0)...

I want to display some Rational values in their decimal expansion. That is, instead of displaying 3 % 4, I would rather display 0.75. I'd like this function to be of type Int -> Rational -> S...

I'm using the Zarith library to do arbitrary-precision rational arithmetic. Suppose I have a rational number q of type Q.t that is the ratio of two big integers (Q is Zarith's arbitrary-precision r...

I want to perform operations on rational matrices. I use the modules numpy and fractions. Here is my code: import numpy as np from fractions import Fraction m=np.matrix([[Fraction(1, 6), Fractio...

I once got the following as an interview question: I'm thinking of a positive integer n. Come up with an algorithm that can guess it in O(lg n) queries. Each query is a number of your choosing, an...