Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

[Boilerplate dubs claiming statement for future post]

Name: Anonymous 2014-12-12 1:37

[Statement elaborating on title]

(11 * n)

Checkem

Program me a fish

Name: Anonymous 2014-12-12 2:09

n = 13
11 * 13 = 143

Nice dubs!

Name: Anonymous 2014-12-12 2:18

nah

Name: Anonymous 2014-12-12 3:25

That great! Now we don't have to see any more of those retarded posts!

Name: Anonymous 2014-12-12 6:34

/prague/ challenge #84817719912982823

Let D(n) denote the ``dubs number'' of n, where the ``dubs number'' of n is defined to be the number of dubs less than or equal to n. Find a closed form expression for D(n) or prove no such closed form exists.

Name: Anonymous 2014-12-12 6:56

>>5

Whatever works man.

11 * (n mod 10) + 100 * (floor(n/10) mod 10)

Tested with a haskell spreadsheet running in homomorphosexual endoeigentensor homomorphic homo mode.

homo

Name: Anonymous 2014-12-12 7:53

>>5,6
(n%100)/11 + (n/100)*10

Name: Anonymous 2014-12-12 17:50

>>7

(n/100)*10

So, n / 10?

Name: Anonymous 2014-12-12 19:34

>>8
0/10

Name: Anonymous 2014-12-12 20:06

>>6
You're forgetting Sieg-o-morpisms.

Name: Anonymous 2014-12-12 20:25

I'm from the Chech republic! Hallo!

Name: Anonymous 2014-12-13 9:08

>>11
Alexander Dubček, please log in.

Newer Posts

[Boilerplate dubs claiming statement for future post]

1 Name: Anonymous 2014-12-12 1:37

2 Name: Anonymous 2014-12-12 2:09

3 Name: Anonymous 2014-12-12 2:18

4 Name: Anonymous 2014-12-12 3:25

5 Name: Anonymous 2014-12-12 6:34

6 Name: Anonymous 2014-12-12 6:56

7 Name: Anonymous 2014-12-12 7:53

8 Name: Anonymous 2014-12-12 17:50

9 Name: Anonymous 2014-12-12 19:34

10 Name: Anonymous 2014-12-12 20:06

11 Name: Anonymous 2014-12-12 20:25

12 Name: Anonymous 2014-12-13 9:08