Ttyjukl

Converting a variable frequency to TTL HIGH and LOW levels, based on a fixed (possible non-fixed?) frequency

Violin - Can double stops be played when the strings are not next to each other?

A single argument pattern definition applies to multiple-argument patterns?

ERC721: How to get the owned tokens of an address

Instead of a Universal Basic Income program, why not implement a "Universal Basic Needs" program?

How well should I expect Adam to work?

Bacteria contamination inside a thermos bottle

Pauli exclusion principle

Most cost effective thermostat setting: consistent temperature vs. lowest temperature possible

How could an airship be repaired midflight?

Why did it take so long to abandon sail after steamships were demonstrated?

Have the tides ever turned twice on any open problem?

Min function accepting varying number of arguments in C++17

Why do passenger jet manufacturers design their planes with stall prevention systems?

Python if-else code style for reduced code for rounding floats

combinatorics floor summation

Recruiter wants very extensive technical details about all of my previous work

What options are left, if Britain cannot decide?

Why does a Star of David appear at a rally with Francisco Franco?

Do I need to be arrogant to get ahead?

What are substitutions for coconut in curry?

Are all passive ability checks floors for active ability checks?

Are relativity and doppler effect related?

Is "upgrade" the right word to use in this context?

combinatorics floor summation

Proof that $sum_{k=0}^m binom{m}{k}frac{1}{k+1} = frac{2^{m+1}-1}{m+1}$Summation involving binomial coefficients: $sum_{i=0}^{100} binom{300}{3i}$summation combinatoric again with floor functionProof of the binomial identity $displaystylebinom{m}{n}=sum_{k=0}^{lfloor n/2 rfloor} 2^{1-delta_{k,n-k}} binom{m/2}{k} binom{m/2}{n-k}$Proof/derivation of $limlimits_{ntoinfty}{frac1{2^n}sumlimits_{k=0}^nbinom{n}{k}frac{an+bk}{cn+dk}}stackrel?=frac{2a+b}{2c+d}$?How to find documentation for or a proof of the following known binomial identityEvaluate summation combinatoricsWeird Combinatorial IdentitiyProve the following by two different methods, one combinatorial and one algebraicFind $sum_{k=0}^{n}4^k binom{n}{k}$

2

$begingroup$

While solving a problem I came across a rather interesting identity, and I do not see how I could prove it.

$sum_{i=0}^{floor(frac{n}{2})} binom{n}{2i}p^{2i}(1-p)^{n-2i} = frac{1}{2}((2p-1)^{n}+1)$

Any ideas?

probability combinatorics summation binomial-coefficients binomial-distribution

share|cite|improve this question

edited 52 mins ago

Austin Mohr

20.5k35098

asked 1 hour ago

SzymonSzymonSzymonSzymon

111

New contributor

SzymonSzymon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  Flip $n$ coins each having probability $p$ of landing heads. The lefthand side is the probability of flipping an even number of heads. I don't immediately see how the righthand side calculates the same probability.
  $endgroup$
  – Austin Mohr
  54 mins ago
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  I believe you have a mistake: the RHS should be $frac12((1-2p)^n+1)$.
  $endgroup$
  – Mike Earnest
  43 mins ago
  

  
  
  
  

add a comment | 

2

$begingroup$

While solving a problem I came across a rather interesting identity, and I do not see how I could prove it.

$sum_{i=0}^{floor(frac{n}{2})} binom{n}{2i}p^{2i}(1-p)^{n-2i} = frac{1}{2}((2p-1)^{n}+1)$

Any ideas?

probability combinatorics summation binomial-coefficients binomial-distribution

share|cite|improve this question

edited 52 mins ago

Austin Mohr

20.5k35098

asked 1 hour ago

SzymonSzymonSzymonSzymon

111

New contributor

SzymonSzymon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  Flip $n$ coins each having probability $p$ of landing heads. The lefthand side is the probability of flipping an even number of heads. I don't immediately see how the righthand side calculates the same probability.
  $endgroup$
  – Austin Mohr
  54 mins ago
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  I believe you have a mistake: the RHS should be $frac12((1-2p)^n+1)$.
  $endgroup$
  – Mike Earnest
  43 mins ago
  

  
  
  
  

add a comment | 

$begingroup$

While solving a problem I came across a rather interesting identity, and I do not see how I could prove it.

$sum_{i=0}^{floor(frac{n}{2})} binom{n}{2i}p^{2i}(1-p)^{n-2i} = frac{1}{2}((2p-1)^{n}+1)$

Any ideas?

probability combinatorics summation binomial-coefficients binomial-distribution

share|cite|improve this question

edited 52 mins ago

Austin Mohr

20.5k35098

asked 1 hour ago

SzymonSzymonSzymonSzymon

111

New contributor

SzymonSzymon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

share|cite|improve this question

edited 52 mins ago

Austin Mohr

20.5k35098

asked 1 hour ago

SzymonSzymonSzymonSzymon

111

New contributor

SzymonSzymon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share|cite|improve this question

edited 52 mins ago

Austin Mohr

20.5k35098

asked 1 hour ago

SzymonSzymonSzymonSzymon

111

New contributor

SzymonSzymon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

edited 52 mins ago

Austin Mohr

20.5k35098

edited 52 mins ago

Austin Mohr

20.5k35098

asked 1 hour ago

SzymonSzymonSzymonSzymon

111

New contributor

SzymonSzymon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 1 hour ago

SzymonSzymonSzymonSzymon

111

2 Answers
2

active

oldest

votes

2

$begingroup$

Let $q=1-p$. Apply the binomial theorem twice, then add:

begin{array}{rrl}
&(p+q)^n&=;;sum_{i=0}^n binom{n}ip^iq^{n-i}\
+&(-p+q)^n&=;;sum_{i=0}^n binom{n}i(-p)^iq^{n-i}\hline
&(p+q)^n+(-p+q)^n &=2sum_{i=0}^{lfloor n/2rfloor}binom{n}{2i}p^{2i}q^{n-2i}
end{array}
To understand the RHS of the sum, note when $i$ is odd we have $p^i+(-p)^i=0$, while when $i$ is even, $p^i+(-p)^i=2p^i$. Replacing $q$ with $1-p$ makes the LHS $1+(1-2p)^n$.

share|cite|improve this answer

edited 38 mins ago

answered 46 mins ago

Mike EarnestMike Earnest

24.8k22151

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Thank you, that's a very neat proof!
  $endgroup$
  – SzymonSzymon
  38 mins ago
  

  
  
  
  

add a comment | 

1

$begingroup$

With the corrected RHS of $frac12((1-2p)^n+1)$ and Austin Mohr's interpretation of the LHS as the probability of an even number of heads occurring in $n$ tosses of coin which comes up heads with probability $p$, the result is easily established by induction.

Case $n = 0$: $frac12((1-2p)^0+1) = 1$, which is correct since zero tosses always produce zero heads.

Case $n > 0$: An even number of heads after $n$ tosses occurs either by having an even number of heads in $n-1$ tosses followed by tails, or an odd number in $n-1$ tosses followed by heads. The probability of this is
$$
begin{align}
&frac12((1-2p)^{n-1}+1)(1-p) + (1 - frac12((1-2p)^{n-1}+1))cdot p\
&= frac12(1-2p)^{n-1}(1-p-p) +frac12(1-p-p) + p\
&= frac12((1-2p)^n + 1),
end{align}
$$
as required.

share|cite|improve this answer

answered 27 mins ago

FredHFredH

2,144914

$endgroup$

add a comment | 

Your Answer

StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});

SzymonSzymon is a new contributor. Be nice, and check out our Code of Conduct.

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3150868%2fcombinatorics-floor-summation%23new-answer', 'question_page');
}
);

Post as a guest

Name

Email

Required, but never shown

2

$begingroup$

Let $q=1-p$. Apply the binomial theorem twice, then add:

begin{array}{rrl}
&(p+q)^n&=;;sum_{i=0}^n binom{n}ip^iq^{n-i}\
+&(-p+q)^n&=;;sum_{i=0}^n binom{n}i(-p)^iq^{n-i}\hline
&(p+q)^n+(-p+q)^n &=2sum_{i=0}^{lfloor n/2rfloor}binom{n}{2i}p^{2i}q^{n-2i}
end{array}
To understand the RHS of the sum, note when $i$ is odd we have $p^i+(-p)^i=0$, while when $i$ is even, $p^i+(-p)^i=2p^i$. Replacing $q$ with $1-p$ makes the LHS $1+(1-2p)^n$.

share|cite|improve this answer

edited 38 mins ago

answered 46 mins ago

Mike EarnestMike Earnest

24.8k22151

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Thank you, that's a very neat proof!
  $endgroup$
  – SzymonSzymon
  38 mins ago
  

  
  
  
  

add a comment | 

2

$begingroup$

Let $q=1-p$. Apply the binomial theorem twice, then add:

begin{array}{rrl}
&(p+q)^n&=;;sum_{i=0}^n binom{n}ip^iq^{n-i}\
+&(-p+q)^n&=;;sum_{i=0}^n binom{n}i(-p)^iq^{n-i}\hline
&(p+q)^n+(-p+q)^n &=2sum_{i=0}^{lfloor n/2rfloor}binom{n}{2i}p^{2i}q^{n-2i}
end{array}
To understand the RHS of the sum, note when $i$ is odd we have $p^i+(-p)^i=0$, while when $i$ is even, $p^i+(-p)^i=2p^i$. Replacing $q$ with $1-p$ makes the LHS $1+(1-2p)^n$.

share|cite|improve this answer

edited 38 mins ago

answered 46 mins ago

Mike EarnestMike Earnest

24.8k22151

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Thank you, that's a very neat proof!
  $endgroup$
  – SzymonSzymon
  38 mins ago
  

  
  
  
  

add a comment | 

$begingroup$

Let $q=1-p$. Apply the binomial theorem twice, then add:

begin{array}{rrl}
&(p+q)^n&=;;sum_{i=0}^n binom{n}ip^iq^{n-i}\
+&(-p+q)^n&=;;sum_{i=0}^n binom{n}i(-p)^iq^{n-i}\hline
&(p+q)^n+(-p+q)^n &=2sum_{i=0}^{lfloor n/2rfloor}binom{n}{2i}p^{2i}q^{n-2i}
end{array}
To understand the RHS of the sum, note when $i$ is odd we have $p^i+(-p)^i=0$, while when $i$ is even, $p^i+(-p)^i=2p^i$. Replacing $q$ with $1-p$ makes the LHS $1+(1-2p)^n$.

share|cite|improve this answer

edited 38 mins ago

answered 46 mins ago

Mike EarnestMike Earnest

24.8k22151

$endgroup$

share|cite|improve this answer

edited 38 mins ago

answered 46 mins ago

Mike EarnestMike Earnest

24.8k22151

answered 46 mins ago

Mike EarnestMike Earnest

24.8k22151

answered 46 mins ago

Mike EarnestMike Earnest

24.8k22151

1

$begingroup$

With the corrected RHS of $frac12((1-2p)^n+1)$ and Austin Mohr's interpretation of the LHS as the probability of an even number of heads occurring in $n$ tosses of coin which comes up heads with probability $p$, the result is easily established by induction.

Case $n = 0$: $frac12((1-2p)^0+1) = 1$, which is correct since zero tosses always produce zero heads.

Case $n > 0$: An even number of heads after $n$ tosses occurs either by having an even number of heads in $n-1$ tosses followed by tails, or an odd number in $n-1$ tosses followed by heads. The probability of this is
$$
begin{align}
&frac12((1-2p)^{n-1}+1)(1-p) + (1 - frac12((1-2p)^{n-1}+1))cdot p\
&= frac12(1-2p)^{n-1}(1-p-p) +frac12(1-p-p) + p\
&= frac12((1-2p)^n + 1),
end{align}
$$
as required.

share|cite|improve this answer

answered 27 mins ago

FredHFredH

2,144914

$endgroup$

add a comment | 

1

$begingroup$

With the corrected RHS of $frac12((1-2p)^n+1)$ and Austin Mohr's interpretation of the LHS as the probability of an even number of heads occurring in $n$ tosses of coin which comes up heads with probability $p$, the result is easily established by induction.

Case $n = 0$: $frac12((1-2p)^0+1) = 1$, which is correct since zero tosses always produce zero heads.

Case $n > 0$: An even number of heads after $n$ tosses occurs either by having an even number of heads in $n-1$ tosses followed by tails, or an odd number in $n-1$ tosses followed by heads. The probability of this is
$$
begin{align}
&frac12((1-2p)^{n-1}+1)(1-p) + (1 - frac12((1-2p)^{n-1}+1))cdot p\
&= frac12(1-2p)^{n-1}(1-p-p) +frac12(1-p-p) + p\
&= frac12((1-2p)^n + 1),
end{align}
$$
as required.

share|cite|improve this answer

answered 27 mins ago

FredHFredH

2,144914

$endgroup$

add a comment | 

$begingroup$

With the corrected RHS of $frac12((1-2p)^n+1)$ and Austin Mohr's interpretation of the LHS as the probability of an even number of heads occurring in $n$ tosses of coin which comes up heads with probability $p$, the result is easily established by induction.

Case $n = 0$: $frac12((1-2p)^0+1) = 1$, which is correct since zero tosses always produce zero heads.

Case $n > 0$: An even number of heads after $n$ tosses occurs either by having an even number of heads in $n-1$ tosses followed by tails, or an odd number in $n-1$ tosses followed by heads. The probability of this is
$$
begin{align}
&frac12((1-2p)^{n-1}+1)(1-p) + (1 - frac12((1-2p)^{n-1}+1))cdot p\
&= frac12(1-2p)^{n-1}(1-p-p) +frac12(1-p-p) + p\
&= frac12((1-2p)^n + 1),
end{align}
$$
as required.

share|cite|improve this answer

answered 27 mins ago

FredHFredH

2,144914

$endgroup$

share|cite|improve this answer

answered 27 mins ago

FredHFredH

2,144914

answered 27 mins ago

FredHFredH

2,144914

answered 27 mins ago

FredHFredH

2,144914