Maths Olympiad Prep

Library / /32 of 106

Algebra Difficulty 8.1 Shortlist Find the answer

A deck of n>1n > 1 cards is given. A positive integer is written on each card. The deck has the property that the arithmetic mean of the numbers on each pair of cards is also the geometric mean of the numbers on some collection of one or more cards.
For which nn does it follow that the numbers on the cards are all equal?

*

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Consider a deck of n>1 n > 1 cards, each with a positive integer written on it. It is given that the arithmetic mean of the numbers on each pair of cards is also the geometric mean of the numbers on some collection of one or more cards. We need to determine for which values of n n it follows that the numbers on the cards are all equal.

### Analyzing the Properties

Let's denote the numbers on the cards as a1,a2,,an a_1, a_2, \ldots, a_n . For any pair of cards (ai,aj) (a_i, a_j) , the arithmetic mean is given by:

Arithmetic Mean=ai+aj2 \text{Arithmetic Mean} = \frac{a_i + a_j}{2}

The condition states that this arithmetic mean equals the geometric mean of some collection of numbers from the cards. Recall that the geometric mean G(x1,x2,,xk) G(x_1, x_2, \ldots, x_k) of a set of numbers is:

G(x1,x2,,xk)=(x1x2xk)1/k G(x_1, x_2, \ldots, x_k) = (x_1 \cdot x_2 \cdot \ldots \cdot x_k)^{1/k}

### Condition for All Numbers Being Equal

To satisfy the condition, consider the simple case when all numbers on the cards are equal. Let all numbers be a a . Then for any pair (ai,aj) (a_i, a_j) :

Arithmetic Mean=a+a2=a \text{Arithmetic Mean} = \frac{a + a}{2} = a

And trivially, the geometric mean of any single card a a or any collection of the same numbers will also be a a . Therefore, if all ai a_i are equal, the condition is naturally satisfied.

### General Case Verification

For n=2 n = 2 , the given condition must hold for any two numbers a1 a_1 and a2 a_2 :

a1+a22=a1a2 \frac{a_1 + a_2}{2} = \sqrt{a_1 \cdot a_2}

Squaring both sides, we get:

(a1+a22)2=a1a2    a12+2a1a2+a224=a1a2 \left(\frac{a_1 + a_2}{2}\right)^2 = a_1 \cdot a_2 \implies \frac{a_1^2 + 2a_1a_2 + a_2^2}{4} = a_1a_2

Simplifying:

a122a1a2+a22=0 a_1^2 - 2a_1a_2 + a_2^2 = 0

This can be rewritten as:

(a1a2)2=0    a1=a2 (a_1 - a_2)^2 = 0 \implies a_1 = a_2

Thus, for n=2 n = 2 , the numbers must indeed all be equal. Since this condition needs to hold for every pair of cards for n>2 n > 2 , the reasoning extends naturally, as if any two numbers differed, it would violate the established condition.

In conclusion, the property that the numbers must be equal holds for n n in general:

n for all n>1 \boxed{n \text{ for all } n > 1}

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.