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.
Without spoiling the challange, could somebody plz answer me how the following criterion is meant:
"Find the sum of the distinct squarefree numbers in the first rows of Pascal's triangle."
The question asks for the sum of distinct squarefree numbers.
QUESTION:
Does this mean the sum of all the numbers witch have distinct mod (10E9+7)? I mean in the binomial table with millions of large numbers, I dont see, why two distinct numbers couldnt have the same modulo 10E9+7. How to account for those numbers?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #203: Squarefree Binomial Coefficients
You are viewing a single comment's thread. Return to all comments →
Without spoiling the challange, could somebody plz answer me how the following criterion is meant:
"Find the sum of the distinct squarefree numbers in the first rows of Pascal's triangle."
The question asks for the sum of distinct squarefree numbers. QUESTION: Does this mean the sum of all the numbers witch have distinct mod (10E9+7)? I mean in the binomial table with millions of large numbers, I dont see, why two distinct numbers couldnt have the same modulo 10E9+7. How to account for those numbers?