To complete the proof of Theorem 2.2, we need to show that for each m 2 M, the
number mRk can be expressed as the sum of k powers of 10 satisfying the condition
described in Theorem 1.1. The case m = 1 is of course trivial, while the remaining six
readily follow from Theorem 2.1. h
As a further remark, we point out that the condition of being ‘‘a complete residue
system modulo k’’ demanded by Theorem 1.1 is actually equivalent to the sum of the
powers of 10 being a multiple of Rk. Although the necessity part is already claimed [3,
Remark 8], we shall now write a complete proof for this fact.
To complete the proof of Theorem 2.2, we need to show that for each m 2 M, thenumber mRk can be expressed as the sum of k powers of 10 satisfying the conditiondescribed in Theorem 1.1. The case m = 1 is of course trivial, while the remaining sixreadily follow from Theorem 2.1. hAs a further remark, we point out that the condition of being ‘‘a complete residuesystem modulo k’’ demanded by Theorem 1.1 is actually equivalent to the sum of thepowers of 10 being a multiple of Rk. Although the necessity part is already claimed [3,Remark 8], we shall now write a complete proof for this fact.
การแปล กรุณารอสักครู่..