Math Is Fun Forum
Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °
You are not logged in.
- Topics: Active | Unanswered
#1 2011-12-08 17:55:24
- juantheron
- Member
- Registered: 2011-10-19
- Posts: 312
binomial
how can i prove that
Offline
#2 2011-12-08 17:59:01
- bobbym
- bumpkin
- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 109,606
Re: binomial
Hi juantheron;
What is the input?
If it is 0,1,2,3,4,5,6,7,... then that is the formula for the catalan numbers which count the number of paths on a lattice. The number of paths is always an integer.
You can write the above expression in another way.
Since you are subtracting two binomials that are always integers you will always have an integer.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline