Re: A83: Tutorials...
[Prev][Next][Index][Thread]
Re: A83: Tutorials...
Yah, we all do. But then you get 0 points... =)
Linus
On 02-Jun-98, Harper Maddox wrote:
>This is the kind of question that I figure is easier to write a program and
>let the calculator do by brute force :)
>-Harper Maddox
>jerky@ebicom.net
>IRC nick: Geori
>ICQ: 1214597
>-----Original Message-----
>From: Bryan Rabeler <brabeler@isd.ingham.k12.mi.us>
>To: assembly-83@lists.ticalc.org <assembly-83@lists.ticalc.org>
>Date: Monday, June 01, 1998 7:37 PM
>Subject: Re: A83: Tutorials...
>>
>>Trey Jazz wrote:
>>
>>> >> PPS: I failed my math final :)...there was a question on "mutual
>>> >> exclusive"...if you have the number 341521 how many ways can you make
>a
>>> odd
>>> >> number if you re-arrange numbers. 360...please say 360 :)...
>>> >
>>> >There are 3 different odd numbers in that 6 digit number, so there are 3
>>> >possibilites for the last place value. The other place values don't
>>> matter.
>>> >So there are 5 posibilites for the first place value, 4 for the second,
>3
>>> for
>>> >the third, 2 for the fouth, 1 for the fith, and 3 for the last one.
>>> >5*4*3*2*1*3 = 360. But since there are two 1's, you must divide that by
>2
>>> >because you could swap the 1's and you would get the same number. So I
>>> think
>>> >the answer should be 180.
>>>
>>> the sample space would still have those two 1s in there so i think it
>should
>>> be 360
>>
>>No, because the two 1's are identical, you can't tell the difference
>between
>>them. 11 is the same as 11. So you have to divide by 2 so you don't count
>them
>>twice.
>>
>>--
>>Bryan Rabeler <brabeler@ticalc.org>
>> File Archives, HTML, and Support
>> the ticalc.org project - http://www.ticalc.org/
>>
>>
References: