Problem 053

shadowboy · Post by **shadowboy** » Thu Sep 04, 2008 9:19 am

For the combinatorics problem 53, ²³C₁₀ is the same as ²³C₁₃. Do these count as two values or 1?

In other words, is the question asking for unique number of values or *total* number?

Tommy137 · Post by **Tommy137** » Thu Sep 04, 2008 11:12 am

They count as two values.

Georg · Post by **Georg** » Thu Sep 04, 2008 11:15 am

The question is asking for *total* number.

jaap · Post by **jaap** » Thu Sep 04, 2008 11:38 am

Rereading it now, it seems ambiguous. Maybe it should read something like:

How many pairs of numbers (n,r), for 1<=n<=100, are there with nCr greater than one-million?

The phrase "values of nCr" in the original question probably shouldn't be used considering 23C10 = 23C13 are both counted but have the same value.

daniel.is.fischer · Post by **daniel.is.fischer** » Thu Sep 04, 2008 1:27 pm

The phrase "How many values of ⁿC_r" can indeed be interpreted in two ways.
You can either consider the function (n,r) → ⁿC_r, which is the intended interpretation here, or you can consider the set of values and its cardinality.
Would "How many values of ⁿC_r, for 1 ≤ n ≤ 100, 0 ≤ r ≤ n, are greater than one-million?" be good?

jaap · Post by **jaap** » Thu Sep 04, 2008 2:08 pm

daniel.is.fischer wrote: Would "How many values of ⁿC_r, for 1 ≤ n ≤ 100, 0 ≤ r ≤ n, are greater than one-million?" be good?

I think that is just as ambiguous. How about:
For 1 ≤ n ≤ 100, 0 ≤ r ≤ n, how often is ⁿC_r greater than one-million?

hk · Post by hk » Thu Sep 04, 2008 4:51 pm

Or simply:
How many, not necessarily distinct, values of nCr, for 1<=n<=100, are greater than one-million?

hk · Post by hk » Sat Sep 06, 2008 10:44 pm

As no further comments were given, I changed it to my version which is nearest to the original version.

m34tcode · Post by **m34tcode** » Wed Jun 08, 2011 1:15 am

Im having a ton of trouble with this one. My program will return 1144066 for ²³C₁₀, but my count is always wrong. tried changing it a little tons of times, really cant see anything wrong. anyone care to look at it? i wrote it in java.

Molx · Post by **Molx** » Wed Jun 08, 2011 4:06 am

If your code correctly returns the ⁿC_r function then it's probably miscounting. I suggest you re-check your code to make sure your're counting according to the problem rules, as I myself often get a wrong interpretation of those.

Next time remember to leave the problem link =)
Problem 53 (View Problem)

Lord_Farin · Post by **Lord_Farin** » Wed Jun 08, 2011 7:52 am

m34tcode wrote:Im having a ton of trouble with this one. My program will return 1144066 for ²³C₁₀, but my count is always wrong. tried changing it a little tons of times, really cant see anything wrong. anyone care to look at it? i wrote it in java.

If you don't manage to solve it with the above suggestion, I could take a look. You can send a PM.

jaap · Post by **jaap** » Wed Jun 08, 2011 10:07 am

Remember to only count the distinct values. For example ²³C₁₀ and ²³C₁₃ are both 1144066 but only count as one rather than two.
Edit: Ignore this post

hk · Post by hk » Wed Jun 08, 2011 11:00 am

jaap wrote:Remember to only count the distinct values. For example ²³C₁₀ and ²³C₁₃ are both 1144066 but only count as one rather than two.

This contradicts earlier posts.

jaap · Post by **jaap** » Wed Jun 08, 2011 2:37 pm

hk wrote:
jaap wrote:Remember to only count the distinct values. For example ²³C₁₀ and ²³C₁₃ are both 1144066 but only count as one rather than two.
This contradicts earlier posts.

Sorry! I remembered it wrong and misunderstood the problem when I reread it. I even contradicted my previous own post (the thread was merged then).

Anyway, every (n,r) pair that gives ⁿC_r greater than a million should be included in the count.

Project Euler Forum

Problem 053

Problem 053

Re: Problem 53

Re: Problem 53

Re: Problem 53

Re: Problem 53

Re: Problem 53

Re: Problem 53

Re: Problem 53

Problem 053

Re: Problem 053

Re: Problem 053

Re: Problem 053

Re: Problem 053

Re: Problem 053