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

2016 AMC 8 Problem 24 Number Theory

This beautiful application is from 2016 AMC 8 Problem 24 based on Number Theory . Sequential hints are given to understand and solve the problem .

2017 AMC 8 Problem 21 Number Theory

This beautiful application from 2017 AMC 8 Problem 21 is based on Number Theory . Sequential hints are provided to study and solve the problem .

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?...

2018 AMC 10A Problem 25 Number Theory

This beautiful application from AMC 2018 is based on Number Theory. Sequential hints are given to understand and solve the problem .

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