Solve a Riddle with Base System Minus 1 - Nadine

nados29
Messages
4
Reaction score
0
Hi,
I've a riddle that I can't solve. I hope someone can help me in it.

Here is it:

If we have a number and add the digits of that number, then subtract the summation we got from the original number, why is the result always multiples of the base system minus 1.

Here is an example using the decimal system (base 10)

The original number is 51, we add the digits, so we get 5+1=6, we subtract it from the original number we got 51-6=45 which is a multiple of 9 (Base 10 -1)

--------------------------------------------------------------------------

Another example in the octal system (base 8)

We have 55, we add the digits we got 12 (octal) or 10 (decimal), we subtract so we have 55-12= 43 (octal) or 35 (decimal) which is a multiple of 7 (base 8 -1)

I hope someone can help me in figuring out this puzzle.
Thanks,
Nadine
 
Physics news on Phys.org
Let us write a number N as follows:
N=\sum_{i=0}^{M}a_{i}b^{i}
where b is the base.
The sum S of the digits is evidently: S=\sum_{i=0}^{M}a_{i}
Hence, the difference D is:
D=\sum_{i=0}^{M}a_{i}(b^{i}-1)
Does that clear it up for you?
 
Last edited:
Thanks a lot :smile:
I never thought it can be that simple.

Thanks again,
Nadine
 
Welcome to PF, BTW!
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top