peuler 0.1.0

A Rust crate with solutions to the Project Euler problems
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

use crate::Solution;
use malachite::Natural;
use malachite::base::num::arithmetic::traits::FloorLogBase;
use malachite::base::num::basic::traits::{One, Two};
use malachite::rational::Rational;

problem!(Problem0057, 57, "Square Root Convergents");

impl Solution for Problem0057 {
    fn solve(&self) -> String {
        let ten_rational = Natural::from(10_u8);
        let mut infinite_fraction = Rational::from_unsigneds(0_u8, 1_u8);
        let mut bigger_numerators = 0;

        for _ in 0..1000 {
            infinite_fraction = Rational::ONE / (Rational::TWO + &infinite_fraction);

            let result = Rational::ONE + &infinite_fraction;

            let numerator_digits = result.numerator_ref().floor_log_base(&ten_rational) + 1;
            let denominator_digits = result.denominator_ref().floor_log_base(&ten_rational) + 1;

            if numerator_digits > denominator_digits {
                bigger_numerators += 1;
            }
        }

        bigger_numerators.to_string()
    }
}