How does this number system conversion algorithm work?

0131313131313
Messages
6
Reaction score
0
50 | 0
25 | 1
12 | 0
6 | 0
3 | 1
1 | 1
0

how does it work?

(I know how to use the algorithm... my question is about how it can do the conversion)
 
Physics news on Phys.org
Looks like Egyptian multiplication.
 
No, I think he simply means conversion of 50 into binary. 50 = 110010 = 32+16+2.
 
CRGreathouse said:
Looks like Egyptian multiplication.

Yes, if you look at the link I posted this is the same thing as what I call Russian multiplication.
 
sjb-2812 said:
Yes, if you look at the link I posted this is the same thing as what I call Russian multiplication.

And this method, in turn, is closely related to the binary representation of the number.
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\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...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

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...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

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...
View full post »

Similar threads

I Localising a non integral domain at a prime
Replies
17
Views
1K
I Smoothing algorithm for real-world data
Replies
12
Views
2K
I Question on Primitive Roots and GCDs
Replies
2
Views
2K
I Matrix diagonalization algorithm
Replies
5
Views
2K
I Jacobi matrix diagonalization problems
Replies
5
Views
2K
I Fourier Transformation on a Ring
Replies
11
Views
3K
MHB Number of solutions for system of equations
Replies
1
Views
1K
A The Klein 4-group
Replies
10
Views
3K
MHB Determine the solution set of the system using the echelon form
Replies
2
Views
1K
I Trouble understanding an online solution to an exercise in Dummit & Foote
Replies
21
Views
694

Hot Threads

Recent Insights

Back
Top