# Project Euler #3: Largest prime factor

This article is part of a series where I'll be diving head first into the Project Euler puzzles. I want to document the challenge of solving such a puzzle and how I got to the answer. I want to prefix this by stating that I can't cheat for any of these challenges; with that I mean I can't look up any other implementations online. After the implementation, I will validate the answer by using this document or a similar sheet.

``````fn is_prime(number: i64) -> bool {
if number < 2 {
return false
}

let mut is_prime: bool = true;
let end = (number as f64).sqrt().floor() as i64;

for i in 2..end+1 {
if number % i == 0 {
is_prime = false;
break
}
}
is_prime
}

fn prime_factor(number: i64) -> i64 {
let mut highest_fac: i64 = 0;
let mut factor: i64 = 2;
let end = (number as f64).sqrt().floor() as i64;

loop {
factor += 1;

if !is_prime(factor) {
continue;
}

if number % factor == 0 && highest_fac < factor {
highest_fac = factor;
}

if factor >= end {
break
}
}
highest_fac
}

#[test]
fn is_prime_tests() {
assert_eq!(is_prime(1), false);
assert_eq!(is_prime(2), true);
assert_eq!(is_prime(3), true);
assert_eq!(is_prime(4), false);
assert_eq!(is_prime(5), true);
assert_eq!(is_prime(7), true);
assert_eq!(is_prime(1151), true);
assert_eq!(is_prime(6228), false);
}

#[test]
fn prime_factors_test() {
assert_eq!(prime_factor(13195), 29);
assert_eq!(prime_factor(600851475143), 6857);
}
``````

The full solution is available on GitHub.