We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #231: The prime factorisation of binomial coefficients
  4. Discussions

Project Euler #231: The prime factorisation of binomial coefficients

Sort by

recency

|

6 Discussions

|

  • bytecodeman
     + 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

  • ramprakashbhagw1
     + 0 comments

    I solved this in c#

  • david_m95_rs
     + 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

  • sc2pu
     + 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

  • bhardwajjsh95
     + 0 comments

    Hi, I am not getting what is going on after step 1. I understand that we have to get sum of prime factors returned by binomial coefficient of N and M, but i want to understand role of K.