Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse

The New Coffee Room

  1. TNCR
  2. General Discussion
  3. Puzzle Time - Birthday Holidays

Puzzle Time - Birthday Holidays

Scheduled Pinned Locked Moved General Discussion
6 Posts 4 Posters 31 Views
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • jon-nycJ Online
    jon-nycJ Online
    jon-nyc
    wrote on last edited by
    #1

    At a certain (fictional) factory, union regulations mandate that any employee's birthday is a holiday for everyone; but except for that, every day is a work day.

    How many people should the factory employ to maximize the expected total number of person-days of work in a year?

    You may assume that all years have 365 days, all of those days are equally likely to be a given person's birthday, and no two employees are twins (or triplets, etc.).

    "You never know what worse luck your bad luck has saved you from."
    -Cormac McCarthy

    1 Reply Last reply
    • KlausK Offline
      KlausK Offline
      Klaus
      wrote on last edited by
      #2

      Hm, doesn't sound very hard, but I may be wrong.

      1 Reply Last reply
      • KlausK Offline
        KlausK Offline
        Klaus
        wrote on last edited by Klaus
        #3

        click to show

        365 or 364 (they yield the same result).

        Which yields an expected number of 48943.52 work days.

        Why?

        The expected number of days that are at least one person's birthday is:

        birthdays(n) = 365 - 365*c^n

        whereby c = (365-1)/365

        That means the expected number of person-days of work in a year is

        n  *  (365- birthdays(n))
        = 
        n * (365-365 + 365*c^n)
        =
        n*365*c^n
        

        Solving for the root of the derivative of this function yields the desired max at n = 1 / log(365/364) = 364.5.

        Maybe there's a simpler way to solve this...

        1 Reply Last reply
        • KlausK Offline
          KlausK Offline
          Klaus
          wrote on last edited by
          #4

          (making the spoiler invisible)

          1 Reply Last reply
          • AxtremusA Offline
            AxtremusA Offline
            Axtremus
            wrote on last edited by Axtremus
            #5

            click to show

            Away from computer. My intuition says for every person added to the employee pool, it adds one whole person-day to the total amount of working day if there is no birthday-holiday rule, but there is always a positive non-zero probability that the added person's birthday is the same as one of the other employees' birthday, and the expected number of holiday added due to the birthday-holiday rule is always less than one. Therefore the number of working person-day is a monotonically increasing function all the way up to the number of days in a year. Hence to maximize number of working days under the given rule, hire the same number of employees as the number of days in a year.

            1 Reply Last reply
            • taiwan_girlT Offline
              taiwan_girlT Offline
              taiwan_girl
              wrote on last edited by
              #6

              I haven't thought about this one yet, but I will.

              But I remember when I was in school. And the teacher told us that in a class of ~35 students, the odds that two of the kids had the same birthday were quite high. (I don't remember the exact number, but I want to say that it was somewhere around 30% or so.). Which seems much higher than expected.

              1 Reply Last reply
              Reply
              • Reply as topic
              Log in to reply
              • Oldest to Newest
              • Newest to Oldest
              • Most Votes


              • Login

              • Don't have an account? Register

              • Login or register to search.
              • First post
                Last post
              0
              • Categories
              • Recent
              • Tags
              • Popular
              • Users
              • Groups