Convert Numbers to Rational Bases: An Example

  • Thread starter Thread starter pseudogenius
  • Start date Start date
  • Tags Tags
    Bases Rational
pseudogenius
Messages
7
Reaction score
0
I have been playing around with numbers in different bases and then I thought, what if they were in fractional bases. I found a way to convert numbers to fractional bases and have been searching on the internet and not found a similar way to do this. Anyway, here is an example of how I would do this:

The problem is: Write 5 in base 3/2

5*(2/3)= 3 remainder 1
6*(2/3)= 2 remainder 0
2*(2/3)= 1 remainder 1
1*(2/3)= 0 remainder 2

Take 2101 and divide each digit by 2.

5 in base 3/2 = 2/2 1/2 0/2 1/2

Check:

(2/2)*(3/2)^3+(1/2)*(3/2)^2+(0/2)*(3/2)^1+(1/2)*(3/2)^0=
27/8+9/8+0+1/2= 5

It worked.

Is it okay to extend digits to rational digits?
Is this a valid way to put integers in rational bases?

I have worked out a way to put rational numbers into rational bases but the process is complicated.
 
Physics news on Phys.org
pseudogenius said:
Is it okay to extend digits to rational digits?
Is this a valid way to put integers in rational bases?

Yes to both. You can even use irrational bases; phi is a popular example.
 
Thank you CRGreathouse,

Onward to irrational and complex bases!
 
pseudogenius said:
Thank you CRGreathouse,

Onward to irrational and complex bases!

For complex bases, Google "quarter-imaginary base".
 
You can read "The Art of Computer Programming" by Donald Knuth, vol I. A great (I don't mean sort of nice, I mean *great*!) book for anyone who has enough brain to ask a question like that. It is readable and humorous as well as seriously mind-stretching. Knuth doesn't need to be obscure to be impressive.
Have a go at negative bases. They are really entertaining.
Here is another, more important one: consider compare examples like base ten, hundred, and thousand. Also 2, 4, 8, 16 etc.
Then, for humorous effect, try root ten, root two, etc.
Try interconversions and arithmetic in each base.
It is a tremendous field for entertaining exploration.

Cheers,

Jon
 
##\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