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

Discussion Overview

The discussion revolves around finding the limit of digit sums for numbers in the set A, which includes integers from 1 to 2013. Participants explore the process of repeatedly summing the digits of a number until a single-digit result is obtained, specifically aiming to determine how many numbers in the set meet the requirement of ultimately resulting in a digit sum of 1.

Discussion Character

  • Exploratory, Mathematical reasoning, Debate/contested

Main Points Raised

  • Some participants propose that there are 224 numbers in the set A that meet the requirement, suggesting a logical approach to find this count.
  • One participant notes that the digital sum preserves the residue class mod 9, indicating that the relevant numbers are those that are 1 more than a multiple of 9.
  • Another participant reiterates the initial problem statement, emphasizing the need to find how many numbers can be picked from A that eventually yield a digit sum of 1.

Areas of Agreement / Disagreement

There is a claim of 224 qualifying numbers, but the discussion does not reach a consensus on the method of verification or the reasoning behind this count, leaving the matter unresolved.

Contextual Notes

The discussion lacks detailed mathematical proofs or explicit definitions of terms used, which may affect the clarity of the arguments presented.

Who May Find This Useful

Participants interested in number theory, digit sums, and modular arithmetic may find this discussion relevant.

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 2 ·
Replies
2
Views
2K
  • · Replies 16 ·
Replies
16
Views
4K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 0 ·
Replies
0
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
17
Views
838
  • · Replies 23 ·
Replies
23
Views
4K