8 posts tagged with integers.
Displaying 1 through 8 of 8. Subscribe:

156829? Mass-market. Tacky.

Artisanal Integers - Summer of 2012. Suddenly several “integer-as-a-service-providers” spring from nowhere. They deliver “artisanal integers”. Integers which (they claim) are “hand-crafted and guaranteed to be unique and hella-beautiful”.
posted by Wolfdog on Feb 4, 2016 - 78 comments

0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, ...

Fair sharing, the Thue-Morse sequence, infinitely long chess games, and related ideas. [A light, 10 minute video]
posted by Wolfdog on Jan 28, 2016 - 17 comments

a(n)=a(n−1)+gcd(n,a(n−1)).

Go ahead: Press the button. A number is printed on the tape. Press again and another number appears. Keep going. A few more. Notice anything special about those numbers? The sequence begins: 5, 3, 11, 3, 23, 3, 47, 3, 5, 3, 101, 3, 7, 11, 3, 13, 233, 3, 467, 3, 5, 3, . . .
posted by Wolfdog on Sep 6, 2015 - 25 comments

Y2GangnamStyle

PSY's 'Gangnam Style' has more views than YouTube can count
posted by mysticreferee on Dec 2, 2014 - 80 comments

The Saddest Thing I Know about the Integers

The integers are a unique factorization domain, so we can’t tune pianos. That is the saddest thing I know about the integers. [more inside]
posted by jenkinsEar on Dec 1, 2014 - 94 comments

Significand of the figure

From the somewhat arbitrary and dimensionful to the timeless classic, one man's subjective list of notable properties of specific numbers. [more inside]
posted by Talkie Toaster on Nov 8, 2012 - 39 comments

Number A Day

NumberADay - Every working day, we post a number and offer a selection of that number’s properties.
posted by Wolfdog on Jan 11, 2012 - 30 comments

Can you stump the Encyclopedia of Integer Sequences?

Can you stump the Encyclopedia of Integer Sequences? Every identifiable sequence known to man, including:

Name: Busy Beaver problem: maximal number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting.
Comment: The sequence grows faster than any computable function of n, and so is non-computable.
Keywords: hard,huge,nice,nonn,bref


If your sequence does not appear there, you might want to try the Super Seeker.
posted by vacapinta on Apr 15, 2002 - 9 comments

Page: 1