Number Patterns and Multiples of 9: Investigating Interesting Sequences from 2-9

  • Context: High School 
  • Thread starter Thread starter TR345
  • Start date Start date
Click For Summary

Discussion Overview

The discussion explores patterns arising from multiplying numbers between 2 and 9 by 2 or 3 and examining the sums of their digits. Participants investigate whether these sums yield multiples of 9 and the implications of these patterns in relation to number theory concepts, particularly in base 10 and modular arithmetic.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Conceptual clarification

Main Points Raised

  • One participant notes that when multiplying numbers n=2,3,4,5,6,7,8, or 9 by 2 repeatedly and summing the digits, interesting patterns emerge, particularly that the sum for 9 is always a multiple of 9.
  • Another participant suggests that when using a multiplier of 3, the pattern for n=7 results in all solutions being multiples of 9, except for 21, which is a multiple of 3.
  • A participant elaborates on the relationship between a number N in base 10 and its digits, stating that the modulo 3 or 9 equivalence can be derived from the sum of its digits.
  • One participant reiterates the initial observations about the patterns for numbers 2, 4, and 8 being similar, while 7 is unique, and emphasizes the significance of the digit sums for 9.
  • There is a mention of the interesting behavior of digit sums when reduced to a single digit, particularly noting that for certain starting numbers, the 7th term in the sequence will revert to the original digit.
  • Another participant introduces the idea that using other multipliers less than 9 (that are not multiples of 3) leads to different sequences that also return to the original number at the 7th term, referencing Fermat's Little Theorem.

Areas of Agreement / Disagreement

Participants express various observations and hypotheses about the patterns, but there is no consensus on the implications or the completeness of the findings. Multiple competing views and interpretations remain present in the discussion.

Contextual Notes

Some assumptions regarding the properties of numbers and their behavior under multiplication and digit summation are not fully explored. The discussion also relies on specific definitions of modular arithmetic and may not address all mathematical nuances involved.

TR345
Messages
112
Reaction score
0
when you take a number n=2,3,4,5,6,7,8,or 9 and multiply by 2 then mulitply the product again by two and so on. Then add the individual digits. You get interesting patterns for each number 2-9. well 2 and 4 and 8 are the same yet have no obvious patern. 7 is unique, 3 and 6 are the same and create an interesting sequence, but when it comes to 9, the sum is always a multiple of 9. 9-9,18-9,36-9,72-9, 144-9,288-18,576-18,1152-9,2304-9,4608-18 ....

If the process is repeated, will there ever be a number where the individual digits don't equal a multiple of 9.

7-7
14-5
28-10
56-11
112-4
224-8
448-16
896-23
 
Physics news on Phys.org
Also if you do the same thing except multiply by 3. Then the patern created when n=7 is that all the sloutions are multiples of 9.
 
TR345 said:
Also if you do the same thing except multiply by 3. Then the patern created when n=7 is that all the sloutions are multiples of 9.
except for 21 which is a multiple of 3. In base 10 if N = ..DCBA = A + 10B +100C + 1000D ... But N mod 3 or 9 is the same as A + B + C + D since you subtracted 9B + 99C + 999D. Since your N is a multiple of 3 or nine and since you subtracted a multiple of 9 you must end up with a multiple of 3 or 9 respectively.
 
Last edited:
TR345 said:
when you take a number n=2,3,4,5,6,7,8,or 9 and multiply by 2 then mulitply the product again by two and so on. Then add the individual digits. You get interesting patterns for each number 2-9. well 2 and 4 and 8 are the same yet have no obvious patern. 7 is unique, 3 and 6 are the same and create an interesting sequence, but when it comes to 9, the sum is always a multiple of 9. 9-9,18-9,36-9,72-9, 144-9,288-18,576-18,1152-9,2304-9,4608-18 ....

If the process is repeated, will there ever be a number where the individual digits don't equal a multiple of 9.

7-7
14-5
28-10
56-11
112-4
224-8
448-16
896-23
The pattern is even more interesting if you keep adding the digits until you get a single digit .e.g. 448 -> 16 -> 7. You will find that since 6 numbers less than 9 are not divisible by 9 (that is phi(9) = 6 ) then for the 7th term in your sequence, the sum of the digits will end up being the digit you started with even if you started with a 3, 6 or 9 which don't appear in the sequence unless you start with a 3 or 6, 6 or 3, or 9 respectively.
As I noted before it all has to do with the relation between base 10 and mod 9.
Edit: Also if you use other multipliers less than 9 (but not itself a multiple of 3) you will get a different sequences that will always equal the number you started with at the 7th term. See Fermat's Little Theorem.
 
Last edited:

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 13 ·
Replies
13
Views
6K
  • · Replies 2 ·
Replies
2
Views
6K
Replies
15
Views
42K