Jump to content

cbox


Recommended Posts

Posted (edited)

What GMOF says whenever I make posts like the one I'm about to make.

 

So anyway, you know how standard binary goes like

0-0
1-1
10-2
11-3
100-4
101-5
110-6
111-7

 

Well with my idea rather than the formula for the number of digits used (x) and the highest number possible (y) being 2^x-1=y...

(If you dont understand this statement then post that you don't and I will explain)

...my idea would use the 0's more efficiently and would use the formula 2(2^x)-3 = y

 

It is hard to explain how this works so I will show you how this works.

0-0
1-1
00-2
01-3
10-4
11-5

notice how with 2 digits I got to the number 5

2(2^(2))-3

2(4)-3=5

 

where as in the old version I got to 3 with 2 digits

2^(2)-1

4-1=3

 

and I will continue into 3 digits as the end of this post.

000-6
001-7
010-8
011-9
100-10
101-11
110-12
111-13

Edited by T3A_guy
Posted (edited)

Sadface :(

 

Noone gets it.

 

This could make computers anywhere from 1.99999 times as fast to 1.2 times as fast BUT NOT 2 lol 2 is the asymptote.

Edited by T3A_guy

Please sign in to comment

You will be able to leave a comment after signing in



Sign In Now
×
×
  • Create New...