2013 Indonesia MO Problems/Problem 6
Revision as of 19:41, 26 December 2024 by Skill issue7 (talk | contribs) (Created page with "==Problem== Suppose <math>p > 3</math> is a prime number and <cmath>S = \sum_{2 \le i < j < k \le p-1} ijk</cmath> Prove that <math>S+1</math> is divisible by <math>p</math>....")
Problem
Suppose is a prime number and Prove that is divisible by .
Solution
if you let be constant, you can think of it as summing for each , , and since its for all you can add another sum to get , and for all we can add another sum, to get since it has a factor pf , we need to prove is always an integer, for prime , so let and for the first case, you get and for the second you get , notice how both of these are always integers, thus it is proven divides
See Also
2013 Indonesia MO (Problems) | ||
Preceded by Problem 3 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 | Followed by Problem 5 |
All Indonesia MO Problems and Solutions |