rodrigovidal

let sieveOfEratosthenes n = 
    let arr = [| for i in 0..n -> 1 |]
    let sqrt = sqrt(float n) |> int
    for k = 2 to sqrt + 1 do
        if arr.[k] = 1 then
            for j in 2*k..k..n-1 do
                arr.[j] <- 0
    seq { for i in 2..n-1 do if arr.[i] = 1 then yield i }

rodrigovidal

open System
open System.Collections.Generic

let sieve n = 
    seq {
        let hash = new HashSet<int64>()
        yield 2L
        for k in 3L..2L..System.Int64.MaxValue do
            if not (hash.Contains k) then
                yield k

rodrigovidal

let factorize n =
    let rec find i =
        if i >= n then None
        elif (n % i = 0) then Some(i, n/i)
        else find(i+1)
    find 2

rodrigovidal

module Tests
open NUnit.Framework
open FsxUnit
open ProjectEuler

type ``Project Euler 1 Tests``() = 
    [<Test>] member test.
        ``Given a empty list sum all members should be equal 0``() =
            [] |> sumAllMultiplesOf3Or5 |> should be (equal 0)
    [<Test>] member test.

rodrigovidal

let isMultipleOf3Or5 x = x % 3 = 0 || x % 5 = 0

let sumAllMultiplesOf3Or5Ref list = 
    list |> List.filter isMultipleOf3Or5 
         |> List.sum

rodrigovidal

let isMultipleOf3Or5 x = x % 3 = 0 || x % 5 = 0

let sumAllMultiplesOf3Or5 list = List.sum (List.filter isMultipleOf3Or5 list)

rodrigovidal

let sumAllMultiplesOf3Or5 list = 
    let mutable total = 0
    for i in list do
        if i % 3 = 0 || i % 5 = 0 then
            total <- total + i
    total
         

rodrigovidal

let numerosExtenso = ["Um"; "Dois"; "Três"]
let numeros = [1;2;3]
let tupla = List.zip numeros numerosExtenso

for i, j in tupla do
    printfn "Numero: %d - Numero por extenso: %s" i j

rodrigovidal

let nome = "Rodrigo Vidal"
nome <- "Don Syme"

rodrigovidal

let nome = "Rodrigo Vidal"
nome = "Don Syme"