<commit_before>﻿namespace ProjectEulerInF
open System

 let isPrime n =
    let sqrt' = (float >> sqrt >> int) n // square root of integer
    [ 2 .. sqrt' ] // all numbers from 2 to sqrt'
    |> List.forall (fun x -> n % x <> 0) // no divisors
 
 let allPrimes =
   let rec allPrimes' n =
     seq { // sequences are lazy, so we can make them infinite
       if isPrime n then
         yield n
       yield! allPrimes' (n+1) // recursing
     }
   allPrimes' 2 // starting from 2
 
 allPrimes
 |> Seq.take 20 // only 20
 |> List.ofSeq // forces evaluation of first 20 items

 let FindBigestPrime =
    let rec FindBigestPrime' n =
        seq {
            if CanDivide n then
            yield n
            yield! 
        }

<commit_msg>Problem 3 in solution example is working, now we need increase number<commit_after>﻿namespace ProjectEulerInF
open System

 let isPrime n =
    let sqrt' = (float >> sqrt >> int) n // square root of integer
    [ 2 .. sqrt' ] // all numbers from 2 to sqrt'
    |> List.forall (fun x -> n % x <> 0) // no divisors
 
 let allPrimes =
   let rec allPrimes' n =
     seq { // sequences are lazy, so we can make them infinite
       if isPrime n then
         yield n
       yield! allPrimes' (n+1) // recursing
     }
   allPrimes' 2 // starting from 2
 
 let primes = allPrimes |> Seq.take 200  |> List.ofSeq 


 let solution = primes |> List.filter(fun x -> 13195 % x = 0)


{'fraction_non_alphanumeric': 0.09907997169143666, 'fraction_numerical': 0.019815994338287332, 'mean_word_length': 2.0343347639484977, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 23, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '3099901', 'n_tokens_mistral': 492, 'n_tokens_neox': 428, 'n_words': 179}