let's have number 3294830924.
i want divide prime numbers, 2, 3, 5, 7, 11, etc..
and want know operations gives me modulo 0.
something like:
int[] primenumbers = ...; var n = 3294830924; return primenumbers.where(pn=> pn < n).where(pn=> n % pn == 0) is there built in function or method list of prime numbers in c# or way calculate in mathematical fashion?
you can create custom function check prime ,
private bool isprime(int number) { if (number < 2) return false; if (number == 2) return true; if (number % 2 == 0) return false; (int = 3; * <= number; += 2) if (number % == 0) return false; return true; } then calculate primes as
var primes = number in enumerable.range(1, your_number) isprime(number) select number;
Comments
Post a Comment