Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Incubator Q&A

Welcome to the staging ground for new communities! Each proposal has a description in the "Descriptions" category and a body of questions and answers in "Incubator Q&A". You can ask questions (and get answers, we hope!) right away, and start new proposals.

Are you here to participate in a specific proposal? Click on the proposal tag (with the dark outline) to see only posts about that proposal and not all of the others that are in progress. Tags are at the bottom of each post.

Splitting a deck of cards into 2 piles Question

+2
−0

A blind person is handed a deck of 52 playing cards and told that exactly 10 of these cards are facing up. How can they divide the cards into two piles, not necessarily of equal size, with each pile having the same number of cards facing up?

History

0 comment threads

1 answer

+3
−0
I don't mean to be flippant but this is actually pretty straightforward.

Of the top 10 cards (really any arbitrary 10-card subset, but this is simplest), suppose N are facing up; since 10 total cards are facing up, the rest of the deck has 10-N cards facing up — all of the face-up cards except for the ones in the top part.

So, let us simply take those 10 cards and turn them upside-down, thus flipping each card. Since N were facing up beforehand, now 10-N are facing up — all of them except for the ones that were before.

Now there are 10-N face-up cards among the flipped cards (the first pile), and the rest of the deck (the second pile) also has 10-N face-up cards, meeting the condition.

History

1 comment thread

Spoiler thread (1 comment)

Sign up to answer this question »