Finding the Limit of Digit Sums in A

  • Context: MHB 
  • Thread starter Thread starter Albert1
  • Start date Start date
  • Tags Tags
    Limit Sums
Click For Summary
SUMMARY

The discussion focuses on finding the count of numbers in the set A = {1, 2, 3, ..., 2013} that, when subjected to a repeated digit sum process, ultimately reduce to 1. The conclusion is that there are exactly 224 numbers in this set that meet the requirement. This is derived from the property that the digital sum preserves residue classes modulo 9, specifically identifying numbers that are 1 more than a multiple of 9.

PREREQUISITES
  • Understanding of digital sums and their properties
  • Familiarity with modular arithmetic, specifically modulo 9
  • Basic knowledge of number theory concepts
  • Ability to perform logical reasoning and proofs without computational tools
NEXT STEPS
  • Study the properties of digital roots and their applications in number theory
  • Learn about modular arithmetic and its significance in mathematical proofs
  • Explore the concept of residue classes and their implications in number sets
  • Investigate other methods for calculating digit sums and their efficiencies
USEFUL FOR

Mathematicians, educators, students in number theory, and anyone interested in the properties of digit sums and modular arithmetic.

Albert1
Messages
1,221
Reaction score
0
digits sum

$A\in ${1,2,3,4,----2013}
a number p is picking randomly from A
if $q_1$=the digits sum of p
if $q_2$=the digits sum of $q_1$
------
continue this procedure until the digits sum=1 then stop
How many numbers we can pick from A ,and meet the requirement ?
 
Last edited:
Physics news on Phys.org
Re: digits sum

Albert said:
$A\in ${1,2,3,4,----2013}
a number p is picking randomly from A
if $q_1$=the digits sum of p
if $q_2$=the digits sum of $q_1$
------
continue this procedure until the digits sum=1 then stop
How many numbers we can pick from A ,and meet the requirement ?
hint:
p can be:
19,28,37,460,1900 ---etc.
all meet the requirement
of course there are more ---
 
try to find it logically ,don't use any pc code

there are 224 numbers in the set:

{1,2,3,4-------2013}

now prove or find it .
 
Re: digits sum

Albert said:
$A\in ${1,2,3,4,----2013}
a number p is picking randomly from A
if $q_1$=the digits sum of p
if $q_2$=the digits sum of $q_1$
------
continue this procedure until the digits sum=1 then stop
How many numbers we can pick from A ,and meet the requirement ?
[sp]Digital sum preserves residue class mod 9. So this set is just the set of all numbers between 1 and 2013 that are 1 more than a multiple of 9. Since $2013 \div 9 = 223\!\frac23$, there are $224$ such numbers.[/sp]
 
my solution:
in fact this is an AP with :
$a_1=1,a_n=2008,\,\,$ and , $d=9$
from :$a_n=a_1+(n-1)d$
we have:$2008=1+(n-1)\times 9$
$2016=9n$
$\therefore n=224$
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
940
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
1K