sat数学.题目看不懂..Tim wrote a seven-digit phone number on a piece of paper.He later tore the paper accidentally and the last two digit were lost.What is the maximum number of arrangements of two digits,using the digits 0 through 9,that he

来源:学生作业帮助网 编辑:作业帮 时间:2024/11/28 20:23:05
sat数学.题目看不懂..Tim wrote a seven-digit phone number on a piece of paper.He later tore the paper accidentally and the last two digit were lost.What is the maximum number of arrangements of two digits,using the digits 0 through 9,that he
xTMoW+oHdv|9vxXjk%Kxpj~Uk\t PZ #ny Ҹ;|!i١7gV#{Fլ&%x8.CG~J'Yx~Χ.qHJ,x0ۛs>6)IV qK"ӣ ʏWy iea a*C_eRyG[594q7?ix%Iңgڳc k! _..TũAm s%jס;Ы&io_g?OQnFiR/A$ZP~; i 8x+pӕ܂Ĭ~vwϠ,)1kqHwsw -=_oЧ&87ӓ6K#?D=Lr 6 7^f\if' uxp*DcDHI X9"'˟~ Ӄ>=̍s*39 0ܶ^?HdnPg嶪b)b9fX,$L gFπE~"cX}eAo-(͌,2[2O^zg퐫2qaޮý(

sat数学.题目看不懂..Tim wrote a seven-digit phone number on a piece of paper.He later tore the paper accidentally and the last two digit were lost.What is the maximum number of arrangements of two digits,using the digits 0 through 9,that he
sat数学.题目看不懂..
Tim wrote a seven-digit phone number on a piece of paper.He later tore the paper accidentally and the last two digit were lost.What is the maximum number of arrangements of two digits,using the digits 0 through 9,that he could use in attempting to reconstruct the correct phone number?

sat数学.题目看不懂..Tim wrote a seven-digit phone number on a piece of paper.He later tore the paper accidentally and the last two digit were lost.What is the maximum number of arrangements of two digits,using the digits 0 through 9,that he
Tim在一张纸上记下了一个七位数的电话号码.后来他不小心撕破了这张纸,号码的最后两位数弄没了.问用数字0到9所能组成的两位数的组合最多有多少,使他能够用来恢复正确的电话号码?
答案肯定是100.0到9任选两个的组合,简单的说就是10x10=100.用公式就是P(1 10)xP(1 10)=100.如果用罗列的办法可知,(00~09)、(10~19)、...(80~89)、(90~99),一共100种组合.

大概意思是说,汤姆写了一个七位数的电话号码在一张纸上,过了一会儿他不小心把纸撕坏了,导致号码的最后两位不见了。问你从0到9最多有多少组合方式,能让他利用在重建正确的电话号码上。
大概要用到排列组合的方式吧。

Tim在一张纸上写了7位电话号码。之后,他偶然间把这张纸撕了,所以最后2个数丢了。从0到9(这十个数字),他尝试重新构造出正确电话的,最多有几种排列组合
就是0到9的排列组合问题
哦,确实是100,简单点说:
确定两位数中的第一位:有10种选择,0-9哪个都行;
确定两位数中的第二位:也有10种选择,0-9哪个都行;
可以重复,如00,55...

全部展开

Tim在一张纸上写了7位电话号码。之后,他偶然间把这张纸撕了,所以最后2个数丢了。从0到9(这十个数字),他尝试重新构造出正确电话的,最多有几种排列组合
就是0到9的排列组合问题
哦,确实是100,简单点说:
确定两位数中的第一位:有10种选择,0-9哪个都行;
确定两位数中的第二位:也有10种选择,0-9哪个都行;
可以重复,如00,55

收起