19. A5 (IND) Let n be a positive integer that is not a perfect cube. Define real numbers a,b,c by a=3n,b=a−[a]1,c=b−∗∗1, where [x] denotes the integer part of x. Prove that there are infinitely many such integers n with the property that there exist integers r,s,t, not all zero, such that ra+sb+tc=0.
This one wants a proof. Work it on paper, then read the official solution and mark
yourself. Be honest about it: the record is only any use to you if it is.
Official solution
19. Write m=[3n]. To simplify the calculation, we shall assume that ∗∗=1. Then a=3n,b=3n−m1=n−m31(m2+m3n+3n2),c=b−11=u+v3n+w3n2 for certain rational numbers u,v,w. Obviously, integers r,s,t with ra+sb+tc=0 exist if (and only if) u=m2w, i.e., if ( b− 1) (m2w+v3n+w3n2)=1 for some rational v,w. When the last equality is expanded and simplified, comparing the coefficients at 1,3n,3n2 one obtains 1:3n:3n2:v+((m2+m3−n)m2+m)w(m2+m3−n)v+mv+=n−m3,(m3+n)w(2m2+m3−n)w=0,=0. In order for the system (1) to have a solution v,w, we must have (2m2+m3−n)(m2+m3−n)=m(m3+n). This quadratic equation has solutions n=m3 and n=m3+3m2+m. The former is not possible, but the latter gives a−[a]>21, so ∗∗=1, and the system (1) in v,w is solvable. Hence every number n=m3+3m2+m,m∈N, satisfies the condition of the problem.
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.