All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Proving divisibility (Posted on 2017-01-08) Difficulty: 2 of 5
Given two integers n (n>1) and an odd prime p. Without loss of generality let p=2k-1.

Prove that if C(n,2) - C(k,2) is divisible by p, it must be divisible also by p2.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
proofDaniel2017-01-09 07:42:29
Some ThoughtsPrime indeed.Jer2017-01-08 16:13:31
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information