Euler 003 Rust Solution

pub fn largest_prime_factor(number: u64) -> u64
{
  let mut answer = 1;
  let mut point = 3;
  let mut divisor = number;

  while divisor % 2 == 0 {
    answer = 2;
    divisor = divisor/2;
  }

  while divisor != 1 {
      while divisor % point == 0 {
        answer = point;
        divisor = divisor/point;
      }
      point += 2;
  }

  return answer;
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn euler_003() {
        assert_eq!(largest_prime_factor(600_851_475_143), 6857);
    }
}