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

  • Thread starter Thread starter neginf
  • Start date Start date
  • Tags Tags
    Sum
Click For Summary
SUMMARY

The discussion focuses on solving the sum over k from 0 to m of |k/m - 1/2| * C(m,k), where m is an even integer, to demonstrate that it equals (1/2) * C(m,m/2). Key equations utilized include C(m,k) = C(m,m-k) and the transformation of the sum into a more manageable form. The attempt at a solution reveals a method of breaking down the sum into parts, ultimately leading to the conclusion that the sum evaluates to zero, thus confirming the relationship with (1/2) * C(m,m/2).

PREREQUISITES
  • Understanding of combinatorial coefficients, specifically C(m,k)
  • Familiarity with properties of binomial coefficients
  • Knowledge of absolute value functions in mathematical expressions
  • Basic experience with summation notation and manipulation
NEXT STEPS
  • Study the properties of binomial coefficients, particularly C(m,k) and its symmetry
  • Explore the concept of generating functions in combinatorics
  • Learn about the application of absolute values in summation problems
  • Investigate advanced techniques for manipulating summations in combinatorial proofs
USEFUL FOR

Mathematics students, combinatorial theorists, and anyone interested in advanced summation techniques and binomial coefficient properties.

neginf
Messages
56
Reaction score
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
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).
 

Similar threads

Replies
2
Views
2K
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
929
Replies
8
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
7
Views
4K