<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: 8 perfect shuffles</title>
	<atom:link href="http://blog.yhuang.org/?feed=rss2&#038;p=84" rel="self" type="application/rss+xml" />
	<link>https://blog.yhuang.org/?p=84</link>
	<description>here.</description>
	<lastBuildDate>Tue, 14 Oct 2025 11:10:14 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.1</generator>
	<item>
		<title>By: me</title>
		<link>https://blog.yhuang.org/?p=84&#038;cpage=1#comment-96199</link>
		<dc:creator>me</dc:creator>
		<pubDate>Wed, 23 Mar 2011 21:27:31 +0000</pubDate>
		<guid isPermaLink="false">http://scripts.mit.edu/~zong/wpress/?p=84#comment-96199</guid>
		<description>If these 16 shuffles are in-shuffles, where the first card goes on top each time, then the top card is the same all the time, and there would be no problem to solve.

So let&#039;s assume you&#039;re talking about out-shuffles, where the first card in the second half of the deck goes on top. For this, you apply a modified version of the first result from the post. Card n in the deck is sent to 2^s*(n+d/2) (mod d-1) in this case. So you are solving 2^16*(n+27) = 0 (mod 53) for n in {0,...,53}, the solution of which is n = 26.

This corresponds to the first card of the third suit, so in your case the ace of hearts.</description>
		<content:encoded><![CDATA[<p>If these 16 shuffles are in-shuffles, where the first card goes on top each time, then the top card is the same all the time, and there would be no problem to solve.</p>
<p>So let&#8217;s assume you&#8217;re talking about out-shuffles, where the first card in the second half of the deck goes on top. For this, you apply a modified version of the first result from the post. Card n in the deck is sent to 2^s*(n+d/2) (mod d-1) in this case. So you are solving 2^16*(n+27) = 0 (mod 53) for n in {0,&#8230;,53}, the solution of which is n = 26.</p>
<p>This corresponds to the first card of the third suit, so in your case the ace of hearts.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rits</title>
		<link>https://blog.yhuang.org/?p=84&#038;cpage=1#comment-93154</link>
		<dc:creator>Rits</dc:creator>
		<pubDate>Thu, 30 Dec 2010 21:10:23 +0000</pubDate>
		<guid isPermaLink="false">http://scripts.mit.edu/~zong/wpress/?p=84#comment-93154</guid>
		<description>Hey,
Can you help me with this problem?

A new deck of cards is in the standard order from the top: ace of spades,
deuce of spades, three of spades…until king of spades. After that all the diamonds follow in the same order, then all the hearts, then clubs.
Finally, there are two jokers on the bottom. After performing 16 perfect shuffles, what number is on the top card now?</description>
		<content:encoded><![CDATA[<p>Hey,<br />
Can you help me with this problem?</p>
<p>A new deck of cards is in the standard order from the top: ace of spades,<br />
deuce of spades, three of spades…until king of spades. After that all the diamonds follow in the same order, then all the hearts, then clubs.<br />
Finally, there are two jokers on the bottom. After performing 16 perfect shuffles, what number is on the top card now?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
