Complicated combinatorics problem

Warren and Nadia have a straight path, one meter wide and 16 meters long, from the front door to the front gate. The decide to pave it. Warren brings home 16 identical paving stones, each 1 meters square. Nadia brings home 8 identical paving stones, each 1 meter x 2 meters. Assuming that they would consider using all square, all rectangular or a combination of each, what is the probability that the combination used consists of all Warren's blocks?

#Combinatorics #MathProblem #Math

Note by Joel Jablonski
7 years, 7 months ago

No vote yet
3 votes

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

I'm getting

Pr(all Warren’s blocks)=1i=08(16i)!i!(162i)!=11597\displaystyle \text{Pr(all Warren's blocks)} = \dfrac{1}{\sum_{i=0}^{8}\dfrac{(16- i)!}{i!\, (16-2\, i)!}} = \dfrac{1}{1597}

gopinath no - 7 years, 7 months ago

Nice problem. Fibonacci is the key - the number of ways of tiling a 1 by 16 path is equal to the number of ways of tiling a 1 by 15 path (by adding a 1 by 1 slab) plus the number of ways of tiling a 1 by 14 path (by adding a 1 by 2 slab), and so on. So there are 1597 (the 17th or 18th Fibonacci number, depending where you start) ways, giving a probability of 1/1597.

Now how about this question: they tile the path from the front door, and choose a slab at random each time from those they have remaining. What's the probability now that they use all of Warren's tiles? What about 8 of Warren's and 4 of Nadia's? More of Warren's than Nadia's? Warren's tiles make up more than half the length of the path?

Paddy MacMahon - 7 years, 7 months ago
×

Problem Loading...

Note Loading...

Set Loading...