Problem 54390. That's not my hat!

Created by Sourabh Warrier

Solve Later

{"parts":[{"partUri":"/matlab/document.xml","contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?><w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>There exists a highly secretive hat consortium. Members possess identical hats. The members are invited to a meeting. All of them bring their hats, but are required to leave them in the shared cloakroom. During the meeting an earthquake strikes the region, leaving the cloakroom a mess. When the members return to the cloakroom, they find all the hats lying on the floor, rendering it impossible to determine the owners. Unwilling to dwell on this, the members each pick up a random hat and leave. Given the number of attendees </w:t></w:r><w:r><w:rPr><w:b/></w:rPr><w:t>n&gt;0</w:t></w:r><w:r><w:t>, the function </w:t></w:r><w:r><w:rPr><w:b/></w:rPr><w:t>c </w:t></w:r><w:r><w:t>computes the number of distinct events where none of the members pick up their original hat. Your task is to define this function.</w:t></w:r></w:p></w:body></w:document>","relationship":null}],"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","target":"/matlab/document.xml","relationshipId":"rId1"}]}

<div style = "text-align: start; line-height: 20.44px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: none solid rgb(0, 0, 0); white-space: normal; "><div style="block-size: 126px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 63px; transform-origin: 407px 63px; vertical-align: baseline; "><div style="font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 63px; text-align: left; transform-origin: 384px 63px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; "><span style="">There exists a highly secretive hat consortium. Members possess identical hats. The members are invited to a meeting. All of them bring their hats, but are required to leave them in the shared cloakroom. During the meeting an earthquake strikes the region, leaving the cloakroom a mess. When the members return to the cloakroom, they find all the hats lying on the floor, rendering it impossible to determine the owners. Unwilling to dwell on this, the members each pick up a random hat and leave. Given the number of attendees </span></span><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; "><span style="font-weight: 700; ">n&gt;0</span></span><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; "><span style="">, the function </span></span><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; "><span style="font-weight: 700; ">c </span></span><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; "><span style="">computes the number of distinct events where none of the members pick up their original hat. Your task is to define this function.</span></span></div></div></div>

Solve

Solution Stats

11 Solutions
6 Solvers

Last Solution submitted on May 18, 2022

Last 200 Solutions

Problem Comments

Problem Recent Solvers6

Problem Tags

combinatorics recursion

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 54390. That's not my hat!

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers6

Suggested Problems

More from this Author1

Problem Tags

Community Treasure Hunt

Problem 54390. That's not my hat!

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers6

Suggested Problems

More from this Author1

Problem Tags

Community Treasure Hunt

Players