You are not logged in.
Pages: 1
GK wrote:1. S-G-C-F
2. S-G-B-F
3. S-G-B-A-E-F
4. S-G-C-D-E-F
5. S-G-B-A-S-G-B-F
6. S-G-B-A-S-G-C-F
7. S-G-B-A-E-D-C-F
8. S-G-B-A-S-D-C-F
9. S-A-B-G-S-D-C-F
10. S-A-B-G-C-D-E-F
11. S-A-B-G-C-F
12. S-A-E-D-C-F
13. S-A-E-F
14. S-D-C-F
15. S-D-E-F#5 and #6 are invalid paths you are walking the edge SG twice.
Ive already said before: there should be 7 paths beginning with SG and 6 paths beginning with SA excluding SABF. It doesnt take much to count them and double-check your answers.
Good Lord. I'm totally lost ..please would you do me a favour and give me the right list.. thanks really..i'd really appreciate it
the answer to number 5 is..
you need to make the 2 denominators the same. for eg.
2/3 + 2/4
u need to find the least common factor (LCF) of 3 and 4..which is 12. so you multiply the 1st one by 4 and the other one by 3. so the fraction will be 8/12 + 6/12 = 14
or if u're allowed to use a calculator, use a TI-83 or a scientific casio (S.V.P.A.M) and the (ab/c) sign will do it
good luck:D
It would be so straightforward if you just used a tree diagram (which is what I keep saying).
You actually missed three (because you listed SDCF and SGBAEF twice). Two of them are SABGCDEF and SABGSDEF. The other is a path beginning with SG there should be 7 distinct SG paths but you listed only 6 distinct ones. Check your SG paths again.
thanks for ur time ..i guess thats it..right ?
1. S-G-C-F
2. S-G-B-F
3. S-G-B-A-E-F
4. S-G-C-D-E-F
5. S-G-B-A-S-G-B-F
6. S-G-B-A-S-G-C-F
7. S-G-B-A-E-D-C-F
8. S-G-B-A-S-D-C-F
9. S-A-B-G-S-D-C-F
10. S-A-B-G-C-D-E-F
11. S-A-B-G-C-F
12. S-A-E-D-C-F
13. S-A-E-F
14. S-D-C-F
15. S-D-E-F
Just use a tree diagram. From S, it can go to A, G or D. If A, it can go from it to B or E; from B it can go to G or F, etc. Exploring all the possible branches from SA, you find there are 7 paths. SG is exactly the same as SA, so there are also 7 paths for SG. And SD is simple: its either SDEF or SDCF, just 2 ways.
im sorry but its kind of confusing..anyway
here are the ones I found (excluding S-A-B-F
1. S-D-C-F
2. S-G-C-F
3. S-D-C-F
4. S-A-E-F
5. S-D-E-F
6. S-G-B-F
7. S-G-B-A-E-F
8. S-A-B-G-C-F
9. S-G-C-D-E-F
10. S-A-E-D-C-F
11. S-G-B-A-E-F
12. S-G-B-A-E-D-C-F
13. S-G-B-A-S-D-C-F
14. S-A-B-G-S-D-C-F
15.
whats the missing one ?
thanks alot
My method is to use a tree diagram. I got 16 ways in all (including SABF). I might be wrong but Im pretty sure thats it.
Thanks, can you please post the ways...
thanks again
Hi everyone..i really need the answer to this problem so i would really appreciate it if you help me..THANKS
A spider is standing on vertex (S) in this cube. (The cube's 8 vertices are (S,A,G,B,E,D,C,F)
(if you cant see the picture, click on the attached one)
The spider wants to walk to vertex (F), To get there it must follow these rules.
1. The spider can walk only along edges
2. The spider can walk along an edge, once only
3. The spider can only go down the vertical edges, never up
4. The spider can visit any vertex expect (F) more than once. When it gets to F, it must stop.
One way to get to F. is S-A-B-F...how many other ways can u find?
Please post the possible ways,too
tHANK U
Pages: 1