On digit sums of multiples of an integer
MetadataShow full item record
Let g > 1 be an integer and Sᶢ (m) be the sum of digits in base g of the positive integer m. In this paper, we study the positive integers n such that sᶢ (n) and sᶢ (kn) satisfy certain relations for a fixed, or arbitrary positive integer k. In the first part of the paper, we prove that if n is not a power of g, then there exists a nontrivial multiple of n say kn such that sᶢ (n) = sᶢ (kn). In the second part of the paper, we show that for any K > 0 the set of the integers n satisfying sᶢ (n) ≤ Ksᶢ (kn) for all k ∈ ℕ is of asymptotic density 0. This gives an affirmative answer to a question of W.M. Schmidt.
The article of record as published may be found at http://dx.doi.org/10.1016/j.jnt.2009.04.003
Showing items related by title, author, creator and subject.
Yorio, Paul R. (Monterey, California : Naval Postgraduate School, 1988);The U.S. Marine Corps deploys Marine Air-Ground Task Forces (MAGTFs) by airlift or sealift to participate in numerous short-term exercises. These exercises are of such duration that resupply of the MAGTF by strategic airlift ...
Puntenney, Michael C. (Monterey, California. Naval Postgraduate School, 1989);Amilitary aircraft deployment problem from the United States Transportation Command is modeled as a generalized transportation problem with side constraints and solved using a general purpose linear programming package. ...
Dell, Robert F.; Román, Pablo E.; Velásquez, Juan D.; Loyola, Pablo S. (2014);Web usage mining has proven to be an important advance for e-business systems, both by finding web user buying patterns and suggesting ways to improve web user navigation. A primary input for web usage mining is web user ...