Blog

While learning about functional programming the simple sieve example was brought up in Haskell. I wanted to try a Kotlin implementation using sequences. Are there any other quick wins without modifying the structure too much? import kotlin.coroutines.experimental.buildSequence import kotlin.system.measureTimeMillis fun sieve(isPrime: Int, ints: Sequence<Int>): Boolean = with(ints.first()){ return when { isPrime < 2 -> falseRead more

I have derived “matrix sieve” algorithm (MSA) for finding primes that is simple, easy to memorize and does not need operations of dividing. MSA is based on the following Theorem: Odd positive integer N=6p-1 (p=1,2,3,…) is a prime iff neither of diophantine equations: 6x^2+(6x-1)y=p 6x^2+(6x+1)y=p has solution. Odd positive integer N=6p+1 (p= 1, 2, 3,Read more