Is This the Correct Identity for Natural Numbers?

  • Thread starter Thread starter oszust001
  • Start date Start date
  • Tags Tags
    Natural
oszust001
Messages
10
Reaction score
0
How can I show that:
\sum_{i=0}^{n}2^{n-i} {n+i \choose i}=2^{2^{n}}
for every natural numbers
 
Physics news on Phys.org
The identity is wrong, it should be

<br /> \sum_{i=0}^{n}2^{n-i} {n+i \choose i}=2^{2 n} <br />
 
ok my foult. so how can i solve that equation?
 
Well, this
<br /> \sum_{i=0}^{n}2^{n-i} {n+i \choose i}=2^{2 n} <br />

is an identity it is true for all n but, if I understand correctly, you may ask for the values of n that make
<br /> \sum_{i=0}^{n}2^{n-i} {n+i \choose i}=2^{2^{n}} <br />
true. In this case we have the equation 2n=2^{2^{n}}, and the solutions are n \in \lbrace 1,2 \rbrace.
 
AtomSeven said:
The identity is wrong, it should be

<br /> \sum_{i=0}^{n}2^{n-i} {n+i \choose i}=2^{2 n} <br />
Version of AtomSeven is good.
How can I show that <br /> \sum_{i=0}^{n}2^{n-i} {n+i \choose i}=2^{2 n} <br />
is good for every natural numbers
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top