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

Polynomial Functional Equation – Random Olympiad Problem

This beautiful application of Functional Equation is related to the concepts of Polynomials. Sequential hints are given to work out the problem and to revisit the concepts accordingly.

Number Theory – Croatia MO 2005 Problem 11.1

This beautiful application from Croatia MO 2005, Problem 11.1 is based on the concepts of Number Theory. Sequential hints are given to work the problem accordingly.

SMO(senior)-2014 Problem 2 Number Theory

This beautiful application from SMO(senior)-2014 is based on the concepts of Number Theory . Sequential hints are provided to understand and solve the problem .

SMO (senior) -2014/problem-4 Number Theory

This beautiful application from SMO(senior)-2014/Problem 4 is based Number Theory . Sequential hints are provided to understand and solve the problem .

The best exponent for an inequality

Understand the problemLet be positive real numbers such that .Find with proof that is the minimal value for which the following inequality holds:Albania IMO TST 2013 Inequalities Medium Inequalities by BJ Venkatachala Start with hintsDo you really need a hint?...

A functional inequation

Understand the problemFind all functions such thatholds for all . Benelux MO 2013 Functional Equations Easy Functional Equations by BJ Venkatachala Start with hintsDo you really need a hint? Try it first!Note that the RHS does not contain $latex y$. Thus it should...

Mathematical Circles Inequality Problem

A beautiful inequality problem from Mathematical Circles Russian Experience . we provide sequential hints . key idea is to use arithmetic mean , geometric mean inequality.

RMO 2019

Regional Math Olympiad (RMO) 2019 is the second level Math Olympiad Program in India involving Number Theory, Geometry, Algebra and Combinatorics.

AMC 2019 12A Problem 15 Diophantine Equation

Beautiful application of Logarithm and Diophantine Equation in American Mathematics Competition (2019) 12A

Costa Rica NMO 2010, Final Round, Problem 4 – Number Theory

The problem is a beautiful application of the techniques in Diophantine Equation from Costa Rica Math Olympiad 2010.