A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 4 years ago
PLEASE HELP!:
see attached picture
anonymous
 4 years ago
PLEASE HELP!: see attached picture

This Question is Closed

zepdrix
 4 years ago
Best ResponseYou've already chosen the best response.1Hmmm I got 41 :O im not sure if im doing this correctly though, is there a mathematical explanation for this? or you just counting the pathes? :D

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0im counting paths i cant figure a formula or something D:

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0wait did you get the 3 t's to be 4?

zepdrix
 4 years ago
Best ResponseYou've already chosen the best response.1each T can connect to 2 H's, yes? :o making +6

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0so you add how many times a letter can go in the lower letter to get all combinations?

zepdrix
 4 years ago
Best ResponseYou've already chosen the best response.1I think so :D that's what I tried to do at least.
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.