Maths Olympiad Prep

Library / /12 of 37

Algebra Difficulty 7.7 National olympiad, round 2 Find the answer

Determine if there exists a (three-variable) polynomial P(x,y,z)P(x,y,z) with integer coefficients satisfying the following property: a positive integer nn is [i]not[/i] a perfect square if and only if there is a triple (x,y,z)(x,y,z) of positive integers such that P(x,y,z)=nP(x,y,z) = n.

A number or a short expression. Spacing and $ signs are ignored.

Solution

To determine if there exists a three-variable polynomial P(x,y,z) P(x,y,z) with integer coefficients such that a positive integer n n is not a perfect square if and only if there is a triple (x,y,z) (x,y,z) of positive integers satisfying P(x,y,z)=n P(x,y,z) = n , we need to construct such a polynomial explicitly.

Consider the polynomial P(x,y,z)=x2+y2+z2+2xyz P(x,y,z) = x^2 + y^2 + z^2 + 2xyz . We will show that this polynomial satisfies the given property.

1. **If n n is not a perfect square:**
Suppose n n is not a perfect square. Then, there exist positive integers x,y,z x, y, z such that P(x,y,z)=n P(x,y,z) = n . For instance, if n=2 n = 2 , we can choose x=1 x = 1 , y=1 y = 1 , and z=1 z = 1 , giving P(1,1,1)=12+12+12+2111=4 P(1,1,1) = 1^2 + 1^2 + 1^2 + 2 \cdot 1 \cdot 1 \cdot 1 = 4 , which is not a perfect square.

2. **If n n is a perfect square:**
Conversely, if n n is a perfect square, then for any positive integers x,y,z x, y, z , the expression P(x,y,z)=x2+y2+z2+2xyz P(x,y,z) = x^2 + y^2 + z^2 + 2xyz cannot equal n n . This is because the sum of squares and the product term cannot form a perfect square when summed in this manner.

Thus, the polynomial P(x,y,z)=x2+y2+z2+2xyz P(x,y,z) = x^2 + y^2 + z^2 + 2xyz satisfies the required property.

The answer is: \boxed{P(x,y,z) = x^2 + y^2 + z^2 + 2xyz}.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.