BradEwing

// Solution to Project Euler Problem 3,
// https://projecteuler.net/problem=3
// brute force
fn main() {
    let mut num = 600851475143i64;
    let mut div = 2;
    let mut v = vec![];
    
    while num > 1 {
        if num%div == 0 { 

BradEwing

// Solution to Project Euler Problem 2,
// https://projecteuler.net/problem=2
fn main() {
    let mut i = 1;
    let mut j = 2;
    let mut tmp;
    let mut result = 0;

    while j < 4000000 {
        if j%2 == 0 { result += j }