How can we determine power of prime $P$ in $C(n,r)$, where $C(n,r)$ denotes the number of combination of $n$ objects taken $r$ at a time. (Also denoted $\binom{n}{r}$ and called a binomial coefficient.)
Subscribe to:
Post Comments (Atom)
analysis - Injection, making bijection
I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...
-
So if I have a matrix and I put it into RREF and keep track of the row operations, I can then write it as a product of elementary matrices. ...
-
I need to give an explicit bijection between $(0, 1]$ and $[0,1]$ and I'm wondering if my bijection/proof is correct. Using the hint tha...
-
Recently I took a test where I was given these two limits to evaluate: $\lim_\limits{h \to 0}\frac{\sin(x+h)-\sin{(x)}}{h}$ and $\lim_\limi...
No comments:
Post a Comment