diff options
| author | Charles Cabergs <me@cacharle.xyz> | 2021-06-18 21:50:31 +0200 |
|---|---|---|
| committer | Charles Cabergs <me@cacharle.xyz> | 2021-06-18 21:50:31 +0200 |
| commit | 93b4c2a215556153ed948260678cd8e840493b39 (patch) | |
| tree | 393edc821a5cd00db7971b4612c98855ff762945 /julia/003-largest_prime_factor.jl | |
| parent | c0aeed4578bdaea39ddbed1b55896948f56b23f3 (diff) | |
| download | project_euler-93b4c2a215556153ed948260678cd8e840493b39.tar.gz project_euler-93b4c2a215556153ed948260678cd8e840493b39.tar.bz2 project_euler-93b4c2a215556153ed948260678cd8e840493b39.zip | |
problem 3 4 5 6 6 in julia
Diffstat (limited to 'julia/003-largest_prime_factor.jl')
| -rw-r--r-- | julia/003-largest_prime_factor.jl | 25 |
1 files changed, 25 insertions, 0 deletions
diff --git a/julia/003-largest_prime_factor.jl b/julia/003-largest_prime_factor.jl new file mode 100644 index 0000000..01e71cf --- /dev/null +++ b/julia/003-largest_prime_factor.jl @@ -0,0 +1,25 @@ +### +# Largest prime factor +# Problem 3 +# +# The prime factors of 13195 are 5, 7, 13 and 29. +# What is the largest prime factor of the number 600851475143 ? +### + +const NUMBER = 600851475143 + +function factors(n) + factors = [] + while n > 1 + for d in 2:n + if n % d == 0 + n = Int64(n / d) + push!(factors, d) + break + end + end + end + factors +end + +println(maximum(factors(NUMBER))) |