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

Sum of Sides of Triangle | PRMO-2018 | Problem No-17

Try this beautiful Problem on Geometry from PRMO -2018.You may use sequential hints to solve the problem.

Recursion Problem | AMC 10A, 2019| Problem No 15

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

Roots of Polynomial | AMC 10A, 2019| Problem No 24

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

Set of Fractions | AMC 10A, 2015| Problem No 15

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

Indian Olympiad Qualifier in Mathematics – IOQM

Due to COVID 19 Pandemic, the Maths Olympiad stages in India has changed. Here is the announcement published by HBCSE: Important Announcement [Updated:14-Sept-2020]The national Olympiad programme in mathematics culminating in the International Mathematical Olympiad...

Positive Integers and Quadrilateral | AMC 10A 2015 | Sum 24

Try this beautiful Problem on Rectangle and triangle from AMC 10A, 2015. Problem-24. You may use sequential hints to solve the problem.

Rectangular Piece of Paper | AMC 10A, 2014| Problem No 22

Try this beautiful Problem on Rectangle and triangle from AMC 10A, 2014. Problem-23. You may use sequential hints to solve the problem.

Probability in Marbles | AMC 10A, 2010| Problem No 23

Try this beautiful Problem on Probability from AMC 10A, 2010. Problem-23. You may use sequential hints to solve the problem.

Points on a circle | AMC 10A, 2010| Problem No 22

Try this beautiful Problem on Number theory based on Triangle and Circle from AMC 10A, 2010. Problem-22. You may use sequential hints to solve the problem.

Circle and Equilateral Triangle | AMC 10A, 2017| Problem No 22

Try this beautiful Problem on Triangle and Circle from AMC 10A, 2017. Problem-22. You may use sequential hints to solve the problem.