Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

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


Math Forum » Discussions » sci.math.* » sci.math

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

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Don Redmond

Posts: 56
Registered: 5/5/11
Congruence involving binomial coefficients
Posted: Feb 23, 2013 1:56 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

A colleague asked me if the following was true and I can't seem to give him an answer. Any help would be appreciated. He has a fair amount of numerical evidence, but just be a victim of the law of small numbers.

Let q be an odd prime such that n = 2q + 1 is also a prime. Let g be an even integer in the interval [2, q + 1]. Finally, let

F(n, g) = [C(n, g) - nC(q, g/2)]/2n,

where C(k, j) is the usual binomial coefficient k!/[j!(k-j)!]. The conjecture is

F(n, g) = 1 (mod q) if g = q + 1 and = 0 (mod q) if not.

Thanks in advance,

Don



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.