1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let isPrime n =
  List.exists (fun i -> n % i = 0) [2..(n - 1)]
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let isPrime n =
  List.exists (fun i -> n % i = 0) [2..(n - 1)]
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      assert (isPrime n)
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun (n:int64) (m:int64) ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..(m - 1)]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..n]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..n]
 ...

1
2
3
4
5
6
7
8
9
open System
open System.Collections.Generic 
 
let recip =
  let cache = Dictionary<_, _>()
  fun n m ->
      if cache.ContainsKey( (n, m) ) then cache.[ (n, m) ]
      else 
        let res = List.find (fun a -> n * a % m = 1) [1..n]
 ...