Understand the problem

Prove that the number of ordered triples $(x, y, z)$  in the set of residues of p such that $(x+y+z)^2  \equiv axyz \mod{p}$, where $gcd(a, p) = 1$ and $p$ is prime is $p^2 + 1$.
Source of the problem
Brazilian Olympiad Revenge 2010
Topic
Number Theory
Difficulty Level
Medium
Suggested Book
Elementary Number Theory by David Burton

Start with hints

Do you really need a hint? Try it first!

First, assume that at least one of x,y,z is zero. Show that there are 3p-2 solutions in this case. Next we need to consider the case where none of them is zero.

Let us denote the residue class of p by \mathbb{Z}_p. Show that, there exist non-zero b,c in \mathbb{Z}_p such that y\equiv bx\;\text{mod}\; p and z\equiv cy\;\text{mod}\; p.

From hint 2, show that (1+b+bc)^2\equiv ab^2cx\;\text{mod}\;p. This means that x\equiv a^{-1}c^{-1}(1+b^{-1}+c)^2\;\text{mod}\;p (you need to convince yourself that the inverses exist).  Now it becomes a matter of simply choosing b,c.

Note that, 1+b^{-1}+c cannot be zero. Given any b\neq p-1, there exists exactly one non-zero c such that 1+b^{-1}+c is 0 modulo p. Hence, in this case there are (p-2)^2 choices. For b=p-1, this special c is actually 0. Hence in this case there are p-1 choices. Thus, the total number of choices is (p-2)^2+(p-1)=p^2-4p+4+(p-1)=p^2-3p+3. Adding to this the 3p-1 cases considered in hint 1, we get p^2+1 as the answer.

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

Tetrahedron Problem | AIME I, 1992 | Question 6

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1992 based on Tetrahedron Problem.

Triangle and integers | AIME I, 1995 | Question 9

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1995 based on Triangle and integers.

Functional Equation Problem from SMO, 2018 – Question 35

Try this problem from Singapore Mathematics Olympiad, SMO, 2018 based on Functional Equation. You may use sequential hints if required.

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.

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.

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.

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.

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.