Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 29 views

    Problem Set 11: Massachusetts Institute of Technology Prof. Albert R Meyer Prof. Adam Chlipala

    Uploaded by

    Josmar Alejandro
    This document is a problem set from a mathematics for computer science course at MIT. It includes 4 problems related to topics like the pigeonhole principle, discrete probability, and conditional probability. Problem 1 involves coloring the entries of an 82x4 matrix and finding patterns. Problem 2 is about a card game with a randomly shuffled deck where the player can take or skip the top card. Problem 3 describes a scenario with cards including aces and calculating conditional probabilities. The document provides context, readings and detailed descriptions for solving each problem.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Problem Set 11: Massachusetts Institute of Technology Prof. Albert R Meyer Prof. Adam Chlipala

    Uploaded by

    Josmar Alejandro
    29 views3 pages
    This document is a problem set from a mathematics for computer science course at MIT. It includes 4 problems related to topics like the pigeonhole principle, discrete probability, and conditional probability. Problem 1 involves coloring the entries of an 82x4 matrix and finding patterns. Problem 2 is about a card game with a randomly shuffled deck where the player can take or skip the top card. Problem 3 describes a scenario with cards including aces and calculating conditional probabilities. The document provides context, readings and detailed descriptions for solving each problem.

    Original Title

    MIT6_042JS15_ps11

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is a problem set from a mathematics for computer science course at MIT. It includes 4 problems related to topics like the pigeonhole principle, discrete probability, and conditional probability. Problem 1 involves coloring the entries of an 82x4 matrix and finding patterns. Problem 2 is about a card game with a randomly shuffled deck where the player can take or skip the top card. Problem 3 describes a scenario with cards including aces and calculating conditional probabilities. The document provides context, readings and detailed descriptions for solving each problem.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    29 views3 pages

    Problem Set 11: Massachusetts Institute of Technology Prof. Albert R Meyer Prof. Adam Chlipala

    Uploaded by

    Josmar Alejandro
    This document is a problem set from a mathematics for computer science course at MIT. It includes 4 problems related to topics like the pigeonhole principle, discrete probability, and conditional probability. Problem 1 involves coloring the entries of an 82x4 matrix and finding patterns. Problem 2 is about a card game with a randomly shuffled deck where the player can take or skip the top card. Problem 3 describes a scenario with cards including aces and calculating conditional probabilities. The document provides context, readings and detailed descriptions for solving each problem.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    Massachusetts Institute of Technology

    6.042J/18.062J, Spring ’15: Mathematics for Computer Science April 22


    Prof. Albert R Meyer & Prof. Adam Chlipala revised Saturday 18th April, 2015, 14:15

    Problem Set 11
    Due: May 1

    Reading:

     Pigeonhole Principle, Inclusion/Exclusion, 14.8 through 14.9 in the course textbook.

     Discrete Probability, 16

     Conditional Probability, 17 through 17.5

    Problem 1. (a) Let R be an 82  4 rectangular matrix each of whose entries are colored red, white or blue.
    Explain why at least two of the 82 rows in R must have identical color patterns.

    (b) Conclude that R contains four points with the same color that form the corners of a rectangle.

    (c) Now show that the conclusion from part (b) holds even when R has only 19 rows.
    Hint: How many ways are there to pick two positions in a row of length four and color them the same?

    Problem 2.
    We play a game with a deck of 52 regular playing cards, of which 26 are red and 26 are black. I randomly
    shuffle the cards and place the deck face down on a table. You have the option of “taking” or “skipping”
    the top card. If you skip the top card, then that card is revealed and we continue playing with the remaining
    deck. If you take the top card, then the game ends; you win if the card you took was revealed to be black,
    and you lose if it was red. If we get to a point where there is only one card left in the deck, you must take it.
    Prove that you have no better strategy than to take the top card—which means your probability of winning
    is 1/2.
    Hint: Prove by induction the more general claim that for a randomly shuffled deck of n cards that are red
    or black—not necessarily with the same number of red cards and black cards—there is no better strategy
    than taking the top card.

    Problem 3.
    Suppose you have three cards: A~, A, and a Jack. From these, you choose a random hand (that is, each
    card is equally likely to be chosen) of two cards, and let K be the number of Aces in your hand. You then
    randomly pick one of the cards in the hand and reveal it.
    (a) Describe a simple probability space (that is, outcomes and their probabilities) for this scenario, and list
    the outcomes in each of the following events:

    1. ŒK  1], (that is, your hand has an Ace in it),


    2. A~ is in your hand,

    2015, Eric Lehman, F Tom Leighton, Albert R Meyer. This work is available under the terms of the Creative Commons
    Attribution-NonCommercial-ShareAlike 3.0 license.
    2 Problem Set 11

    3. the revealed card is an A~,


    4. the revealed card is an Ace.
     
    (b) Then calculate Pr K D 2 j E for E equal to each of the four events in part (a). Notice that most, but
    not all, of these probabilities are equal.
    Now suppose you have a deck with d distinct cards, a different kinds of Aces (including an A~), you
    draw a random hand with h cards, and then reveal a random card from your hand.
    (c) Prove that PrŒA~ is in your hand] D h=d .

    (d) Prove that


      2d
    Pr K D 2 j A~ is in your hand D PrŒK D 2] . : (1)
    ah
    (e) Conclude that
       
    Pr K D 2 j the revealed card is an Ace D Pr K D 2 j A~ is in your hand :
    MIT OpenCourseWare
    https://ocw.mit.edu

    6.042J / 18.062J Mathematics for Computer Science


    Spring 2015

    For information about citing these materials or our Terms of Use, visit: https://ocw.mit.edu/terms.

    You might also like