[Boilerplate dubs claiming statement for future post]
Name:
Anonymous2014-12-12 1:37
[Statement elaborating on title]
(11 * n)
Checkem
Program me a fish
Name:
Anonymous2014-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.