Seems quite hard

Printable View

February 15th 2008, 10:26 AM
james_bond

Seems quite hard

Prove that $\forall p$ prime and $r\in\mathbb{Z}$ $\exists n\in\mathbb{N}$ for which $\binom{2n}{n}\equiv r\pmod{p}$ .

All times are GMT -8. The time now is 06:39 AM.

Copyright © 2005-2013 Math Help Forum. All rights reserved.

Copyright © 2005-2013 Math Help Forum. All rights reserved.