A Binomial Coefficient Question

Find the remainder when (12342)+(12346)+(123410)+(12341230)+(12341234) {1234 \choose 2} + {1234 \choose 6} + {1234 \choose 10} \ldots + {1234 \choose 1230} + {1234 \choose 1234} is divided by 30 30 .

#BinomialCoefficients #TorqueGroup

Note by Anqi Li
7 years, 5 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Let NN denote that expression, because (nk)=(nnk) {n \choose k } = {n \choose n-k}

N=(12341232)+(12341228)+(12341224)++(12344)+(12340)N = {1234 \choose 1232 } + {1234 \choose 1228 } + {1234 \choose 1224 } + \ldots + {1234 \choose 4 } + {1234 \choose 0 }

Add the "original" NN and the above equation

2N=(12340)+(12342)+(12344)+(12346)++(12341230)+(12341232)+(12341234) 2N = {1234 \choose 0 } + {1234 \choose 2 } + {1234 \choose 4 } + {1234 \choose 6 } + \ldots + {1234 \choose 1230 } + {1234 \choose 1232 } + {1234 \choose 1234 }

Because k=0n(2n2k)=22n1 \displaystyle \sum_{k=0}^n {2n \choose 2k} = 2^{2n-1}

2N=21233 2N = 2^{1233}

N=21232 N = 2^{1232}

N(mod2)0 N \pmod {2} \equiv 0

N(mod3)(1)12321 N \pmod {3} \equiv (-1)^{1232} \equiv 1

N(mod5)21232 mod4201 N \pmod {5} \equiv 2^{ 1232 \space \bmod {4} } \equiv 2^0 \equiv 1 , by Fermat's Little Theorem

Because 2,3,52,3,5 are pairwise coprime, we can find NN modulo 3030 by Chinese Remainder Theorem, the answer is 16\boxed{16}

Pi Han Goh - 7 years, 5 months ago

Log in to reply

Do you mean k=0n(2n2k)=22n1 \displaystyle\sum_{k=0}^{n} \dbinom {2n}{2k} = 2^{2n-1} ?

Josh Rowley - 7 years, 5 months ago

Log in to reply

Fixed......... THANKS

Pi Han Goh - 7 years, 5 months ago
×

Problem Loading...

Note Loading...

Set Loading...