首页 > 其他分享 >MathProblem 38 Meeting at a restaurant problem

MathProblem 38 Meeting at a restaurant problem

时间:2022-08-17 05:22:10浏览次数:58  
标签:10 38 frac restaurant MathProblem problem Meeting

Two people arrive in a restaurant independently. Each arrives a random time between 5pm and 6pm, distributed uniformaly (no moment in this range is any more likely for arrival than another). What is the probability they arrived within 10 minutes of each other?

Solution

假设一个人到的时间为 \(x\),另一个人为 \(y\),则限制条件为

\[|x-y|\leq 10 \]

然后在坐标轴上面画出范围即可,那么概率即为两条线之间的面积比上总面积:

\[\frac{1100}{3600}=\frac{11}{36} \]

标签:10,38,frac,restaurant,MathProblem,problem,Meeting
From: https://www.cnblogs.com/xinyu04/p/16593571.html

相关文章

  • MathProblem 37 Common birthday problem
    Whatistheminimumnumberofpeopledoyouneed,chosenatrandom,sothatthereisatleasta50%chancethatatleasttwohavethesamebirthday.Assumetha......
  • 《GB28380-2012》PDF下载
    《GB28380-2012微型计算机能效限定值及能效等级》PDF下载《GB28380-2012》简介本标准规定了台式微型计算机、具有显示功能的一体式台式微型计算机和便携式计算机的能效......
  • 《GB28381-2012》PDF下载
    《GB28381-2012离心鼓风机能效限定值及节能评价值》PDF下载《GB28381-2012》简介本标准规定了离心鼓风机的能效限定值、节能评价值及试验方法;本标准适用于单级双支撑......
  • 《JavaStudy38》static关键字详解
    static的属性和方法  代码块 ......
  • CF464E The Classic Problem
    题解:首先要注意到一个数+$2^k$的在二进制中的运算过程是将一段连续都为1的区间都赋0,然后将下一个为0的位置改为1想到可持久化数组然后dij一下就好了有几个值得留下的......
  • MathProblem 35 Light bulb problem #1
    Youhavetenlightbulbs.Fivehaveanaveragelifeof100hours,andtheotherfivehaveaaveragelifeof200hours.Theselightbulbshaveamemorylessprop......
  • leetcode738-单调递增的数字
    单调递增的数字贪心算法先对数字进行遍历,找出从零开始单调递增的子序列。如果此时i小于数组长度,意味着数组不是全部递增的,需要对数组进行修改。那么让i从后向前进行遍......
  • MathProblem 34 Drug test problem
    10%ofthepeopleinacertainpopulationuseanillegaldrug.Adrugtestyieldsthecorrectresult90%ofthetime,whetherthepersonusesdrugsornot.Ar......
  • MathProblem 31 Compound interest problem #1
    Whatisthevalueof$1,investedforoneyearat100%interest,compoundedinfinitely?SolutionGenerally,thevalueof$1investedfor\(n\)yearsatinteres......
  • CF464E The Classic Problem(线段树 最短路)
    CF464ETheClassicProblem\(\bigstar\texttt{Hint}\):发现没有什么好的突破口?为什么不想想怎样才能实现题目中\(2^x\)的加减法呢?可见每次加减法,我们要做的是将添加的......