Non-Integral Bases in Computer Science | CompSci Forum Discussion

  • Thread starter Thread starter abhishek
  • Start date Start date
  • Tags Tags
    Bases
abhishek
Messages
36
Reaction score
0
Apologies if this is in the wrong forum. :smile:

In a discussion we're having on our compsci forums at uni, about binary numbers, someone brought up the notion of non-integral bases. I take it to mean numbers with bases that aren't integers. Is this right?

I've never encountered such a thing before, so I'm curious about it. I've only seen bases defined as integers - is it valid to think of non-integral bases? Do the same processes for understanding and converting integer bases apply to non-integers?

I have no specific questions, really. How does it work? How is it meaningful? What are some applications of it? Links to further information would be nice.

Searching the web turns up almost no information about this, so I wonder if it goes by any other names too.

Thanks to anyone who can shed some light on the matter. :smile:
 
Physics news on Phys.org
No, I believe it's problematic. Imagine taking base \pi. Then \pi would have a finite \pi-ary expansion. What's worse is that it doesn't make sense to use decimals in this case. When you have a base n, then the digits in your expansion can take values from {0, 1, .., n-1}. What if you have base \pi? There's no reasonable choice.
 
This can be done.
call our base b
1234(base b)=1*b^3+2*b^2+3*b+a
as usual digits are chosen as integers such that 0<=digit<=b
any positive real except one can be used as a base.
The two main problems that arise are
1) accuracy can become an issue and rational numbers have not reapeating decimal expansions.
2) non uniqueness. This has to do with algebraic bases.
2=10=1.01010101010101010101... (base sqrt(2))
4=10000=100=11.010000010010... (base sqrt(2))
here are some things in base pi
pi=10 (base pi)
e=2.2021201002111122001 (base pi)
17=120.2200211010202300
 
AKG said:
No, I believe it's problematic. Imagine taking base \pi. Then \pi would have a finite \pi-ary expansion. What's worse is that it doesn't make sense to use decimals in this case. When you have a base n, then the digits in your expansion can take values from {0, 1, .., n-1}. What if you have base \pi? There's no reasonable choice.
pi=10 (base pi) is not a problem
Even though the base is nonintegral the digits are still integers.
 
but the concept raises an interesting question : what can you say about a number which has a periodic development in base pi ?
such as a = 1.0101010101(base pi) = pi+pi^3+pi^5+...
it is tempting to name those numbers "rationals in base pi"
However, they look like p-adic numbers, because of the infinite right part.
They also look like elements of an hilbert space, or infinite polynomials in pi

what about addition, multiplication, ... of those numbers ? is there a closed operation ?
 
##\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