MHB Dave's Airport Adventure: Find m + n!

  • Thread starter Thread starter veronica1999
  • Start date Start date
veronica1999
Messages
61
Reaction score
0
Dave arrives at an airport which has twelve gates arranged in a straight
line with exactly 100 feet between adjacent gates. His departure gate is
assigned at random. After waiting at that gate, Dave is told the departure
gate has been changed to a different gate, again at random. Let the
probability that Dave walks 400 feet or less to the new gate be a fraction
m/n , where m and n are relatively prime positive integers. Find m + n .

I got the answer 52 but I am not that happy with my solution.
(I think I solved it using brute force because the problem was simple)
Can someone show me a better way?

Total choices are 12X11.
I listed all the gates and tried each one out.
4+5 +6 + 7 +8 + 8 +8 +8 +7 + 6 +5 +4 = 76

76/121 = 19/33

Thanks.
 
Mathematics news on Phys.org
View attachment 288

The horizontal and the vertical axes represent the first and the second random gates, respectively. The surrounded area represents points (x, y) such that |x - y| ≤ 4. This so because |x - y| ≤ 4 ⇔ -4 ≤ x - y ≤ 4 ⇔ x - 4 ≤ y ≤ x + 4. You need to calculate the number of thick dots. The number of unmarked points on the grid is 2(7 + ... + 1) + 12 = 7 * 8 + 12 = 68, so there are indeed 12 * 12 - 68 = 76 thick dots. The only remark is that 19 / 33 = 76 / 132, not 76 / 121.
 

Attachments

  • gates.png
    gates.png
    4.1 KB · Views: 85
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top