- #1

- 31

- 0

I havent seen this in math so I am a bit confused, just wanted to know what this was called so I can read up on a tutorial.

thanks!

- Thread starter Jkohn
- Start date

- #1

- 31

- 0

I havent seen this in math so I am a bit confused, just wanted to know what this was called so I can read up on a tutorial.

thanks!

- #2

- 100

- 0

http://ultrastudio.org/en/MechengburakalkanApplet-1.7.zip

I havent seen this in math so I am a bit confused, just wanted to know what this was called so I can read up on a tutorial.

thanks!

You have to run the Applet.

- #3

- 31

- 0

- #4

- 20

- 0

In fact, there is a number called "e" which is an irrational value like pi, that is approximately 2.71828, that crops up very, very often in seemingly unrelated maths all throughout the field. The base of e is an extremely useful base, particularly when you reach exponential functions in calculus.

- #5

- 31

- 0

since the remainder of n/2 [until x^0]

can be used to get binary code

example

6 3 0

3 1 1

1 0 1

110=6

can I assume this for all bases?

ty!

- #6

- 13

- 0

since the remainder of n/2 [until x^0]

can be used to get binary code

example

6 3 0

3 1 1

1 0 1

110=6

can I assume this for all bases?

ty!

(assuming integer divide that truncates the number)

For 6 from base 10 to base 2:

6%2 = 0, 6/2 = 3

3%2 = 1, 3/2 = 1

1%2 = 1, 1/2 = 0

You stop at zero on the second and the list of numbers reversed is the binary: 110

Just like you did.

This works for all integer bases:

For 47 from base 10 to base 16 (using A-F for 10-15):

47%16 = 15, 47/16 = 2

2%16 = 2, 2/16 = 0

Hex: 2F

If you want a higher base, you have to have something to represent it, or you just put a comma between numbers like (2,15) instead of 2F or 0x2F

I guess you could call it decimal to other base conversion. To convert back is a little more complicated. You can do the same in that base (which can be confusing if you don't have a table), but it's easier to represent each numeral by the power representation of the base in that location and add it up to convert back, because you can do that in decimal.

Oh, like Kael42 said. Base can really be anything. You may want to stick to positive integer bases that are 2 are larger (2,3,4,5,...) until you get an idea how it works first. Well, you can do unary also, but then you'll have a lot of 1's across the screen.

Last edited:

- #7

- 662

- 1

Yet another approach to go from base 10 to base n:

Let x be written in base 10, to be written in base n:

i) Find the largest integer power a_1 of n that is smaller than x, i.e., n^a_1< x, but

n^(a_1+1)>x . Find the quotient q_1 of x by n^a1

ii) Find the largest integer power a_2 of n that is smaller than x-(n^a_1)

Again, find the quotient q_2 of x-q_1(n^a_1) by n^a2

iii) In the last step, you either get a multiple of n, then set q_k=0 , or you get

some number y smaller than n (this means x-(n^a_1-n^a_2-... n^a_(k-1) <n ), then set

q_k=y.

iv) Your number in base n is q_1q_2....q_k.

Example: 1670 in base 7:

i) Largest power of 7 smaller than 1670 is 343 . The quotient of 1670 by 343 is 4,

so q_1:=4

ii) Largest power of 7 smaller than (1670-4(343)=298) is, now 49, and the quotient

of 298 by 49 is 6 , so q_2:=6

iii) since q_2=4<7, declare q_4:= 4.

Then 1670 in base 7 is 4604 ; (4604)_7 = 4.7^0+ 0.7^1+ 6.7^2+ 4.7^3 =

4.1+0.7+ 6.49+ 4.343 = 4+0+ 294+ 1372.

So, basically, you recursively substract the multiple of the largest power of the base that is larger than zero , until you get something smaller than n.

Let x be written in base 10, to be written in base n:

i) Find the largest integer power a_1 of n that is smaller than x, i.e., n^a_1< x, but

n^(a_1+1)>x . Find the quotient q_1 of x by n^a1

ii) Find the largest integer power a_2 of n that is smaller than x-(n^a_1)

Again, find the quotient q_2 of x-q_1(n^a_1) by n^a2

iii) In the last step, you either get a multiple of n, then set q_k=0 , or you get

some number y smaller than n (this means x-(n^a_1-n^a_2-... n^a_(k-1) <n ), then set

q_k=y.

iv) Your number in base n is q_1q_2....q_k.

Example: 1670 in base 7:

i) Largest power of 7 smaller than 1670 is 343 . The quotient of 1670 by 343 is 4,

so q_1:=4

ii) Largest power of 7 smaller than (1670-4(343)=298) is, now 49, and the quotient

of 298 by 49 is 6 , so q_2:=6

iii) since q_2=4<7, declare q_4:= 4.

Then 1670 in base 7 is 4604 ; (4604)_7 = 4.7^0+ 0.7^1+ 6.7^2+ 4.7^3 =

4.1+0.7+ 6.49+ 4.343 = 4+0+ 294+ 1372.

So, basically, you recursively substract the multiple of the largest power of the base that is larger than zero , until you get something smaller than n.

Last edited:

- #8

HallsofIvy

Science Advisor

Homework Helper

- 41,833

- 961

- #9

- 12

- 0

I totally wrote a program like this with Qt, it converted to a ton of bases, from *negasexagesimal* to *phinary, quater-imaginary, balanced ternary* to *sexigasmal*..

Here:**http://neuraloutlet.wordpress.com/projects/ [Broken]**

You just need to have a good read through here:**http://en.wikipedia.org/wiki/Numeral_system**

Here:

You just need to have a good read through here:

Last edited by a moderator:

- Last Post

- Replies
- 8

- Views
- 10K

- Last Post

- Replies
- 34

- Views
- 9K

- Last Post

- Replies
- 3

- Views
- 2K

- Last Post

- Replies
- 6

- Views
- 4K

- Last Post

- Replies
- 2

- Views
- 4K

- Last Post

- Replies
- 15

- Views
- 3K

- Last Post

- Replies
- 6

- Views
- 7K

- Last Post

- Replies
- 6

- Views
- 3K

- Last Post

- Replies
- 1

- Views
- 8K

- Replies
- 2

- Views
- 3K