How Do Addition and Multiplication Tables Work in Base -5?

1+1=1
Messages
93
Reaction score
0
i am curious as to how this would look. i wonder how the addition tables would look in base -5? would the multiplication look the same?

here is what i know so far:

addition multiplication
0 1 2 3 4 0 0 0 0 0
1 2 3 4 10 0 1 2 3 4
2 3 4 10 11 0 2 4 11 13
3 4 10 11 12 0 3 11 14 22
4 10 11 12 13 0 4 13 22 31

i know this, but where are the negative signs at??
 
Last edited:
Physics news on Phys.org
Negative bases

Interesting concept, here's some links to info on negative bases:
http://mathforum.org/library/drmath/view/55710.html
http://www.maa.org/devlin/devlinfeb.html
One thing the articles point out is that no sign is necessary,
instead negative and positive numbers differ in their number
of digits.
 
Last edited by a moderator:
these negative bases are quite interesting, although are they reallly used all that much? i know that everyone I've talked to is basically saying "no." however, almost anyone could make up their own number system, but no one else could understand it.
 
In Alice in Wonderland, when Alice has fallen down the rabbit hole, she wonders if she's swapped places with someone called Mabel. To discover her true identity, she recites the 4 times table:

"But if I'm not the same, the next question is, 'Who in the world am I?' Ah, that's the great puzzle!... and I'm sure I can't be Mabel, for I know all sorts of things, and she, oh! she knows such a very little!... I'll try all the things I used to know. Let me see: four times five is twelve, and four times six is thirteen, and four times seven is -- oh dear! I shall never get to twenty at that rate!"

Figure out why this is true !
 
this definitely has something to do with numbers that are NOT base 10. other than that, i'll have to sleep on it. :wink:
 
##\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...

Similar threads

Back
Top