Solving Sum with C(m,k) - (1/2) * C(m, m/2)

  • Thread starter neginf
  • Start date
  • Tags
    Sum
In summary, the problem is to find the sum over k from 0 to m of |k/m - 1/2| * C(m,k), where m is even. Using the equations C(m,k)=C(m,m-k) and (k/m) * C(m,k) = C(m-1,k-1), the attempt at a solution involved rewriting the sum as |k/n * C(n,k) - 1/2 * C(n,k)| and simplifying it to 0. The desired term 1/2 * C(n,n/2) is present in the second sum, but further steps may be necessary to prove that the entire sum is equal to it.
  • #1
neginf
56
0

Homework Statement



Sum over k from 0 to m of |k/m - 1/2| * C(m,k) where m is even to get (1/2) * C(m,m/2).

Homework Equations



C(m,k)=C(m,m-k)
1/2 - (m/2) / m = 0
(k/m) * C(m,k) = C(m-1,k-1)

The Attempt at a Solution



Tried things like:
sum over k from 0 to m of |k/m - 1/2| * C(m,k)
2 * sum over k from 0 to m/2 of |k/m - 1/2| * C(m,k)
= 2 * sum k from 0 to m/2 of (1/2 - k/m) * C(m,k)
= 2 * sum k from 0 to m/2 of ((1/2) * C(m,k) - k/m * C(m,k))
= sum k 0 to m/2 of C(m,k) - 2 * [sum k from 1 to m/2 of C(m-1,k-1)]
 
Last edited:
Physics news on Phys.org
  • #2
What am I doing wrong ?

sum over k from 0 to n of |k/n - 1/2|*C(n,k)
=sum over k from 0 to n of |k/n * C(n,k) - 1/2 * C(n,k)|
=|sum over k from 1 to n-1 of C(n-1,k-1) - sum over k from 0 to n of 1/2 * C(n,k)|
=|2^(n-1) - 1/2 * 2^n|
=0

The 1/2 * C(n,n/2) term I hope to show the whole sum is equal to is in the second sum that's in the | | signs.
1/2 * C(n,k)=1/2 * C(n,0) + .. .+ 1/2 *C(n,n/2) + ... + 1/2 * C(n,n).
 

1. How do you solve a sum with C(m,k) - (1/2) * C(m, m/2)?

The first step in solving this sum is to determine the values for m and k. Once you have these values, you can plug them into the formula for the combination function C(m,k). Then, you can multiply this result by 1/2 and also calculate C(m, m/2). Finally, you can subtract the two values to get your final answer.

2. What is the purpose of using the combination function in this sum?

The combination function, denoted by C(m,k), is used to calculate the number of ways to choose a subset of k elements from a set of m elements. In this sum, the combination function is used to determine the values that are being subtracted from each other.

3. Are there any special cases for solving this type of sum?

Yes, there are a few special cases to consider. If k is equal to 0 or m, then C(m,k) will equal 1. Additionally, if k is equal to m/2, then C(m,m/2) will equal 1/2 * C(m,m/2), resulting in a final answer of 0.

4. Can this sum be solved using a calculator?

Yes, this sum can be solved using a calculator. Many scientific calculators have a combination function button that can be used to quickly calculate C(m,k) and C(m,m/2).

5. What are some real-life applications of using this type of sum?

The combination function has many practical applications in fields such as statistics, probability, and computer science. For example, it can be used to calculate the probability of winning a lottery or to determine the number of possible combinations in a password. In scientific research, it can be used to analyze data and make predictions based on different combinations of variables.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
577
  • Calculus and Beyond Homework Help
Replies
8
Views
235
  • Calculus and Beyond Homework Help
Replies
2
Views
210
  • Calculus and Beyond Homework Help
Replies
9
Views
915
  • Calculus and Beyond Homework Help
Replies
3
Views
492
  • Calculus and Beyond Homework Help
Replies
15
Views
1K
  • Calculus and Beyond Homework Help
Replies
17
Views
1K
  • Calculus and Beyond Homework Help
Replies
6
Views
475
  • Calculus and Beyond Homework Help
Replies
5
Views
535
  • Calculus and Beyond Homework Help
Replies
7
Views
2K
Back
Top