Maths Olympiad Prep

Library / /62 of 144

Number theory Difficulty 8.2 Shortlist Find the answer

Determine whether there exists an infinite sequence of nonzero digits a1,a2,a3,a_1 , a_2 , a_3 , \cdots and a positive integer NN such that for every integer k>Nk > N, the number akak1a1\overline{a_k a_{k-1}\cdots a_1 } is a perfect square.

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

Solution

To determine whether there exists an infinite sequence of nonzero digits a1,a2,a3, a_1, a_2, a_3, \ldots and a positive integer N N such that for every integer k>N k > N , the number akak1a1 \overline{a_k a_{k-1} \cdots a_1} is a perfect square, we analyze the structure of perfect squares and the requirements of the sequence.

1. Understanding the Problem:
The problem asks for an infinite sequence of nonzero digits, such that the number formed by the first k k digits in reverse order is a perfect square for k>N k > N .

2. Properties of Perfect Squares:
- A perfect square b2 b^2 (for some integer b b ) typically has a number of digits that increases roughly by a factor of 2 for each additional digit in b b .
- The structure and distribution of digits in perfect squares follow particular patterns. For instance, the last digit of a perfect square ends only in 0, 1, 4, 5, 6, or 9.

3. Contradiction via Limitations of Nonzero Digits:
- The sequence akak1a1 \overline{a_k a_{k-1} \cdots a_1} , composed entirely of nonzero digits, implies the number does not end in zero.
- As k k \to \infty , the sequence length k k should still form a perfect square. Each perfect square needs to adhere to integer properties such as divisibility and congruence relations (e.g., a number conservatively ending in certain digits, discussed before).

4. Logical Analysis:
- Suppose for contradiction that such a sequence and N N exist. For very large k k , the number of digits in a perfect square must align with log10(b2)+1 \lfloor \log_{10}(b^2) \rfloor + 1 , where b2=akak1a1 b^2 = \overline{a_k a_{k-1} \cdots a_1} .
- Consider ever-increasing b b , and hence b2 b^2 , to maintain the perfect square property.
- However, the requirement for all digits a1,a2,,ak a_1, a_2, \ldots, a_k to be nonzero severely restricts the possibility for all b2 b^2 's necessary divisibility and ending digit patterns, especially as b b becomes very large (i.e., imbalances the density of typical nonzero digit ends).

5. Conclusion:
- The structural constraints and requirements imposed on b2 b^2 by the infinite sequence of nonzero digits lead to an eventual impossibility.
- There can't be an infinite sequence where every freshly formed akak1a1 \overline{a_k a_{k-1} \cdots a_1} remains a perfect square past a certain point N N .

Thus, there exists no such infinite sequence satisfying the problem's conditions. The answer is:
No \boxed{\text{No}}

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.