- All Contests
- ProjectEuler+
- Project Euler #231: The prime factorisation of binomial coefficients
- Discussions

# Project Euler #231: The prime factorisation of binomial coefficients

# Project Euler #231: The prime factorisation of binomial coefficients

Challenge Author + 2 comments I suggest to anyone who wants to solve this challenge to read the post of Lucy_Hedgehog https://projecteuler.net/thread=10;page=5

It is a nice, simple and efficient way to compute the sum of primes without listing them.

+ 1 comment I coded a solution in PHP but the system times out on all but the first 4 simple cases. Is there anyway to increase the timeout on this system?

I'm a newbie in this environment.

or do I have to recode in another language.

THx

+ 0 comments I solved this in c#

+ 0 comments Hi, I'm trying to solve the problem using Python3, but i'm unable to use input() to enter values for N,M and k. At first i thought that this values where automaticaly given, but it didn't work. Does anyone know how to solve this problem? thanks

+ 0 comments Can someone give a hint to this? Sieving is too slow even for (10^9)/2 for it to be the right way. The case where k=1 is fine, but how can I solve larger k without knowing the large primes factor of nCm. Getting the product of all primes < N also slow. Is iterating fron k=1 up right? Or is it from from (n-m+1)C1 -> (n-m+2)C2 ->... nCm. Because of k, the problem is quiet different from project euler

Sort 6 Discussions, By:

Please Login in order to post a comment