|
|
|
|
is an integer
|
(Theorem)
|
|
Proof. The proof is by induction on  . For  , the claim is clear. Thus, suppose the claim holds for  . For
 , Pascal's rule gives
That is,
 are integers. Since
the proof is complete. 
|
Anyone with an account can edit this entry. Please help improve it!
" is an integer" is owned by matte.
|
|
(view preamble)
Cross-references: complete, Pascal's rule, clear, induction, integer, binomial coefficient
There is 1 reference to this entry.
This is version 3 of is an integer, born on 2005-02-14, modified 2005-02-14.
Object id is 6744, canonical name is NchooseRIsAnInteger.
Accessed 4600 times total.
Classification:
| AMS MSC: | 05A10 (Combinatorics :: Enumerative combinatorics :: Factorials, binomial coefficients, combinatorial functions) | | | 11B65 (Number theory :: Sequences and sets :: Binomial coefficients; factorials; $q$-identities) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|