PDA

View Full Version : [In Progress] Count up in a somewhat complex way

Shidoshi
2011-07-21, 03:57 AM
So we have hex. We have binary. We have base 110. How could I make it more complex?

By changing the bases dependant on the digit.

The base will be (distance from decimal place + 1). So the ones place will count up in base 2, the tens place will be base 3, the hundreds will be base 4, etc.

Here's an example of the first ten posts:

1
10
11
20
21
100
101
110
111
120

etc.

I shall start:

1

Yes, this will be complicated. The first digit of the number is in base 2, second in base 3, third in base 4, etc.

Jedward
2011-07-21, 11:02 PM
...
10

Raul
2011-07-21, 11:10 PM
11

Nalek
2011-07-21, 11:27 PM
..20?

shouri
2011-07-22, 03:12 AM
anyone who didn't understand just follow this guideline:

units digit (0 or 1 only)
tens (0 1 or 2)
hundreds (0 1 2 or 3)
.
.
.

also, yes "20" was fine

Also....

21

Valon
2011-07-22, 03:28 AM
100

Yokuyin
2011-07-22, 03:56 AM
101

I assume if we reach 9987654321 (= 3.627.999 in base 10), the next one is A0000000000?

Shidoshi
2011-07-22, 05:26 AM
I assume if we reach 9987654321 (= 3.627.999 in base 10), the next one is A0000000000?

eyup

110

Holypie
2011-07-22, 07:03 AM
111

Unauthorized Intruder
2011-07-23, 10:59 AM
120

Shidoshi
2011-07-23, 03:53 PM
121

octopusprime
2011-07-23, 05:16 PM
tooooo huntert

OB3LISK
2011-07-24, 02:57 PM
I didn't get it so idk what comes next, but I'll post anyway for the fun.

Shidoshi
2011-07-24, 04:30 PM
I didn't get it so idk what comes next, but I'll post anyway for the fun.

This is not the shenanigans.

201

Chainspark
2011-07-24, 06:05 PM
210

sicnarf
2011-07-24, 06:09 PM
211

octopusprime
2011-07-24, 10:23 PM
220

Shidoshi
2011-07-25, 12:59 AM
221

Panacea
2011-07-25, 02:03 AM
300.

sicnarf
2011-07-25, 02:06 AM
301

octopusprime
2011-07-25, 02:06 AM
301 + 9

Sonufabitch.

Baklava
2011-07-25, 02:40 AM
100 + 100 + 100 + 5 + 5 + 1

octopusprime
2011-07-25, 02:54 AM
2^6×5

I like where this is going.

Noah
2011-07-25, 03:22 AM
Ah, the factorial number system! Used to map a single number n to a single permutation of an array. Been used quite much, actually. It's a good tool.

321

def toFNS(n):
k = 0
while fact(k) <= n:
k += 1
indexList = []
numberList = range(k).reversed()
for x in numberList:
quot = n // fact(x)
indexList.append(quot)
n %= fact(x)
return indexList

Noah

Shidoshi
2011-07-25, 05:30 AM
The idea was shamelessly stolen from another site, the xkcd forums.

1000

Fius
2011-07-25, 05:42 AM
..1001?
Possible combo breaker

Unauthorized Intruder
2011-07-25, 11:53 AM
1010

Shidoshi
2011-07-25, 12:03 PM
1011

shouri
2011-07-25, 12:49 PM
1020

Holypie
2011-07-25, 01:02 PM
1021 I hope

octopusprime
2011-07-25, 04:47 PM
1300

Shidoshi
2011-07-26, 01:19 PM
1300

urdoinitwrong

1101 (correct counting)

octopusprime
2011-07-26, 01:30 PM
urdoinitwrong

1101 (correct counting)

1300 IT WILL BE RIGHT EVENTUALLY

1111

Turtally
2011-07-26, 02:09 PM
1120, I think.

octopusprime
2011-07-26, 05:05 PM
1121

Turtally
2011-07-26, 05:17 PM
1200

sicnarf
2011-07-27, 02:08 AM
1201

Turtally
2011-07-27, 02:09 AM
1210

Shidoshi
2011-07-28, 12:24 AM
1211

Unauthorized Intruder
2011-07-28, 01:34 AM
1220

Tenshi
2011-07-28, 02:19 AM
1221

octopusprime
2011-07-28, 03:26 AM
1300

toldja

Shidoshi
2011-07-28, 04:45 PM
1301

Kalovale
2011-08-03, 12:54 PM
1310

I read "so we have sex" for the intro... and thought what kinda game is this.

Derosis
2011-08-03, 03:38 PM
1311

Shidoshi
2011-08-03, 03:43 PM
1310

I read "so we have sex" for the intro... and thought what kinda game is this.

What a silly pony...

1320

Kalovale
2011-08-03, 05:25 PM
What a silly pony...

1320

public static int shidoCount(int ini) {
int place = 1;
int digit;
boolean maxBase;
int copy = ini;
do {
maxBase = true;
digit = copy%10; // extract right-most digit
if(digit < place) {
maxBase = false;
}
else {
copy = copy/10; // cut off the right-most digit
ini -= digit*Math.pow(10, place-1);
place++; // keep track of the place of the 'current' right most digit
}

} while(maxBase && copy > 0);

if(!maxBase) {
ini += Math.pow(10, place-1);
}
else {
ini = (int) Math.pow(10, place-1);
}
return ini;
}

1321

Luacake
2011-08-06, 01:43 AM
2000

Shidoshi
2011-08-23, 05:46 AM
2001