Skip to content

Curve Stitchings & Card Shufflings

April 15, 2015

Here’s something non-pedagogy related and rather brief and who knows. Here goes.

Fun Fact!

1) The solution to this problem (in short: how many perfect shuffles until a 52 card deck is back in its original order)

AND

2) the creation of this picture:

blah

Are the same thing:

Waning Moon

So… I’m just gonna let that sit out there in the open with very little explanation. Maybe you’re curious. Maybe not. I certainly am.

Related and very cool: http://www.openprocessing.org/sketch/192276

and: http://tube.geogebra.org/student/m992965

Two other sets of related questions:

1) Will an n card deck always take n perfect shuffles before it’s back in its original order?
2) If each of the n dots in the circle are really n nails in a piece of circular wood, can I create this design with a single thread of string?

Also, this post couldn’t have happened without Dan Anderson. All this math is his fault.

Advertisements

From → Math

Leave a Comment

Collaborate

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: