Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Congruence involving binomial coefficients
Replies: 3   Last Post: Feb 25, 2013 6:49 AM

 Search Thread: Advanced Search

 Messages: [ Previous | Next ]
 linux Posts: 9 Registered: 4/4/07
Re: Congruence involving binomial coefficients
Posted: Feb 25, 2013 3:35 AM
 Plain Text Reply

"quasi" <quasi@null.set> a écrit dans le message de news:
f8vji8tc9tmgnqv86eabjn34rbfotvotgp@4ax.com...
> --- (9) lemma
>
> If n is an odd positive integer such that q = (n-1)/2 is an odd
> prime, then A(n,k) = 0 mod q for all even integers k with
> 2 <= k <= q-1.
>
> Proof outline:
>
> The verification for k = 2 is immediate. Proceeding by induction
> on k, assume k is even with 2 < k <= q-1 and simplify the
> difference A(n,k) - A(n,k-2). It's not hard to show (not hard
> but a little tedious) that, assuming 2 < k <= q-1, the difference
> is congruent to 0 mod q, hence the truth of the lemma follows
> from its truth for k=2.
>
> quasi

(9)
Note that if q is prime et k is an integer with 2 <= k <= q-1, it is
easy to prove that
Binomial(2q+1,k) an Binomial(q,k) are divisible by q without induction.
For this , the hypothesis 2q+1 prime is not necessary.

Date Subject Author
2/23/13 Don Redmond
2/24/13 quasi
2/25/13 linux
2/25/13 quasi

© The Math Forum at NCTM 1994-2018. All Rights Reserved.