
Nov 5th, 2000, 06:37 PM
#1
Thread Starter
Frenzied Member
Eight Sprinters are running in a race. If there are no ties, in how many ways can:
a. First Place be awarded?
b. first and second places be awarded
c. first, second, and third places be awarded
d. all eight places be awarded
this isn't a trick question, i just dont know how to solve it, can someone please give me the answer to a, b, c, and d, and also explain what you did to get your answer
NXSupport  Your onestop source for computer help

Nov 5th, 2000, 07:22 PM
#2
transcendental analytic
1 = 8
8
2 = 28
8
3 = 56
8
8 = 8
8
Use
writing software in C++ is like driving rivets into steel beam with a toothpick.
writing haskell makes your life easier:
reverse (p (6*9)) where p xx==0=""True=chr (48+z): p y where (y,z)=divMod x 13
To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.

Nov 5th, 2000, 07:25 PM
#3
Thread Starter
Frenzied Member
i think that 2 = 64 or 2 = 2! or something, i'm not sure, but i'm pretty sure that 2, 3, 4 are wrong, if not, explain your logic, and how you got the answer
NXSupport  Your onestop source for computer help

Nov 5th, 2000, 07:53 PM
#4
Fanatic Member
Been a long time since i have lied with numbers (statistics), but i think it is something like.
a) 8
b) 8 ways of 1st place, * 7 ways for 2nd place
c) 8 ways of 1st place, * 7 ways for 2nd place * 6 ways for 3rd place
d) 8 ways of 1st place, * 7 ways for 2nd place * 6 ways for 3rd place * 5 ways for 4th place * 4 ways for 5th place * 3 ways for 6th place * 2 ways for 7th place * 1 ways for 8th place
Iain, thats with an i by the way!

Nov 5th, 2000, 08:04 PM
#5
Thread Starter
Frenzied Member
ok, thanks..... here's one more:
A small business has its own internal phone system, Each phone number is four digits long, The first digit must be 2 to indicate an internal call, and the second digit cannot be 0. How many internal phone numberss are possible for this company?
now how would i go about solving this problem?
NXSupport  Your onestop source for computer help

Nov 5th, 2000, 08:08 PM
#6
transcendental analytic
actually i was looking at pascals triangle when finding out those. WEll they are binominal coeficients
900 numbers i guess that's 10^310^2
Use
writing software in C++ is like driving rivets into steel beam with a toothpick.
writing haskell makes your life easier:
reverse (p (6*9)) where p xx==0=""True=chr (48+z): p y where (y,z)=divMod x 13
To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.

Nov 5th, 2000, 08:12 PM
#7
transcendental analytic
BTW if you want the binominal formula:
n! / (k! * (n  k)!)
where n is total items to choose from and k amount of items to choose
Use
writing software in C++ is like driving rivets into steel beam with a toothpick.
writing haskell makes your life easier:
reverse (p (6*9)) where p xx==0=""True=chr (48+z): p y where (y,z)=divMod x 13
To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.

Nov 5th, 2000, 08:25 PM
#8
Frenzied Member
Do you ever do your own homework Dimava?
Harry.
"From one thing, know ten thousand things."

Nov 5th, 2000, 08:52 PM
#9
Thread Starter
Frenzied Member
lol..... its just that sometimes i get stuck on it, and i have one more last problem:
The big breakfast at Dot's Restaurant offers diners one choice from each of the following:
eggs (fried, poached, scrambled, overeasy)
potatoes or grits
toast (wheat, white, or muffin)
meat (sausage, ham, or bacon)
juice (orange, grapefruit, tamato, apricot, grape, apple)
How many diffrent big breakfasts are there?
please tell me how to solve it
NXSupport  Your onestop source for computer help

Nov 5th, 2000, 09:01 PM
#10
Frenzied Member
If you were paying attention to the way the other guys on this thread solved your first 2 problems, you ought to be able to apply some of the same ideas to this problem. I know you're, like, 12 or something, but this isn't so hard. Don't you think you ought to do at least 1 out of 3 questions yourself?
Harry.
"From one thing, know ten thousand things."

Nov 5th, 2000, 09:13 PM
#11
Thread Starter
Frenzied Member
ok, i see what you're saying, i'll try, and, jsut to get it correct, i'm asking for help on 3 out of 38 questions, and i'm 13 (since 11/1/00)
NXSupport  Your onestop source for computer help

Nov 5th, 2000, 11:04 PM
#12
Addicted Member
I think there are around 400 different breakfeast, i don't know fore sure how close that is.
The way i did wast to break the different types of foods (ie Toast , eggs) into there own number so there fou different types of eggs so i did this
eggs1,eggs2,eggs3,eggs4 I did this four all the other types so
i could evaluate the numbers instead of the breakfeastes
I tried my method ou evaluateing the numbers with very simple numbers first(ie a1,a2,b1,b2).
I tried all the combination of a1,a2,b1,b2 to see if there was some rule that goverend how many combinations there where. I found out that how many different a's there are times the number of b's gives you the number of combinations(ie 2 a's, 2 b's combinations=2*2)
I'm not at all sure that that's correct so do it yourself to see if it is.
[Edited by Bjwbell on 11052000 at 11:07 PM]

Nov 5th, 2000, 11:11 PM
#13
Frenzied Member
Yes that's the correct method, assuming that there is no option not to have any or all of the ingredients.
Dimava, I take it back on the point about 1 question out of three if you have 38 questions.
Harry.
"From one thing, know ten thousand things."

Nov 5th, 2000, 11:17 PM
#14
transcendental analytic
well dimiva you would have to start learning see what type of qwestion it is.
It's all about choices you find out how many there are, use + operator for or and * operator for and, so you do for the types of eggs and potatoes or grits is
(1+1+1+1) * (1+1)
and so on, you get 4*2*3*3*6 which should be 432
hope you get start thinking yourself soon, then you will notice how easy it really is
Use
writing software in C++ is like driving rivets into steel beam with a toothpick.
writing haskell makes your life easier:
reverse (p (6*9)) where p xx==0=""True=chr (48+z): p y where (y,z)=divMod x 13
To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.

Nov 6th, 2000, 07:08 AM
#15
Thread Starter
Frenzied Member
ok, thanks to all that helped
NXSupport  Your onestop source for computer help
Posting Permissions
 You may not post new threads
 You may not post replies
 You may not post attachments
 You may not edit your posts

Forum Rules

Click Here to Expand Forum to Full Width
