Understand the problem

Given a prime number $p$ and let $\overline{v_1},\overline{v_2},\dotsc ,\overline{v_n}$ be $n$ distinct vectors of length $p$ with integer coordinates in an $\mathbb{R}^3$ Cartesian coordinate system. Suppose that for any $1\leqslant j<k\leqslant n$, there exists an integer $0<\ell <p$ such that all three coordinates of $\overline{v_j} -\ell \cdot \overline{v_k} $ is divisible by $p$. Prove that $n\leqslant 6$.

Source of the problem

Kürschák Competition 2018

Topic
Number Theory
Difficulty Level
Hard
Suggested Book

Start with hints

Do you really need a hint? Try it first!

Prove that any two vectors are either perpendicular or colinear.

Note that p^2| |\overline{v_j}-\ell\cdot\overline{v_k}|^2. This implies that p^2|\langle \overline{v_j},\overline{v_k}\rangle. Also, from the Cauchy-Schwarz inequality we get |\overline{v_j}|\cdot |\overline{v_k}|\ge |\langle\overline{v_j}.\overline{v_k}\rangle| hence -|\overline{v_j}|\cdot |\overline{v_k}|\le\langle\overline{v_j}.\overline{v_k}\rangle\le |\overline{v_j}|\cdot |\overline{v_k}|. Also, $latex | \overline{v_j}|\cdot |\overline{v_k}|=p^2$. As the dot product is also divisible by p^2, it has to be equal to \pm p^2 or 0. It cannot be p^2 because the vectors are distinct, hence it is either -p^2 or 0. Thus the two vectors are either perpendicular or colinear (adding to 0).

Let us plot the vectors in \mathbb{R}^3 and identify them with their tips (as the tails are at the origin). We join two tips by a straight line segment if they correspond to perpendicular vectors. Show that the number of straight lines is at least \frac{n(n-2)}{2}. Also prove that, there do not exist 4 vectors such that every possible pair of tips is joined by a line segment.

From the last assertion, show that the number of straight line segments in the figure is at most \frac{n^2}{3} (this is a special case of a result called Turan’s theorem). Thus, \frac{n^2}{3}\ge \frac{n(n-2)}{2}. Hence n\le 6

Watch video

Connected Program at Cheenta

Math Olympiad Program

Math Olympiad is the greatest and most challenging academic contest for school students. Brilliant school students from over 100 countries participate in it every year. Cheenta works with small groups of gifted students through an intense training program. It is a deeply personalized journey toward intellectual prowess and technical sophistication.

Similar Problems

Sequence and greatest integer | AIME I, 2000 | Question 11

Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 2000 based on Sequence and the greatest integer.

Arithmetic sequence | AMC 10A, 2015 | Problem 7

Try this beautiful problem from Algebra: Arithmetic sequence from AMC 10A, 2015, Problem. You may use sequential hints to solve the problem.

Series and sum | AIME I, 1999 | Question 11

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1999 based on Series and sum.

Inscribed circle and perimeter | AIME I, 1999 | Question 12

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 2011 based on Rectangles and sides.

Problem based on Cylinder | AMC 10A, 2015 | Question 9

Try this beautiful problem from Mensuration: Problem based on Cylinder from AMC 10A, 2015. You may use sequential hints to solve the problem.

Median of numbers | AMC-10A, 2020 | Problem 11

Try this beautiful problem from Geometry based on Median of numbers from AMC 10A, 2020. You may use sequential hints to solve the problem.

LCM and Integers | AIME I, 1998 | Question 1

Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 1998, Problem 1, based on LCM and Integers.

Cubic Equation | AMC-10A, 2010 | Problem 21

Try this beautiful problem from Algebra, based on the Cubic Equation problem from AMC-10A, 2010. You may use sequential hints to solve the problem.

Problem on Fraction | AMC 10A, 2015 | Question 15

Try this beautiful Problem on Fraction from Algebra from AMC 10A, 2015. You may use sequential hints to solve the problem.

Pen & Note Books Problem| PRMO-2017 | Question 8

Try this beautiful Pen & Note Books Problem from Algebra from PRMO 2017, Question 8. You may use sequential hints to solve the problem.