A community for students.
Here's the question you clicked on:
 0 viewing
LollyLau
 4 years ago
[Extremely Long Question] Let 121231234 be a set of 3 groups where different groups are seperated by s. All the groups must contain consecutive numbers and the first group must start with 1. There are also rules for the following groups: 1. The first number follows the last number from the previous group (left), or 2. The group's numbers entirely consists of the previous group's last number. The number of numbers in each group doesn't change no matter how the numbers change inside the group (clumsy). How many combinations are there for
1. 111111
2. 11111111 ?
LollyLau
 4 years ago
[Extremely Long Question] Let 121231234 be a set of 3 groups where different groups are seperated by s. All the groups must contain consecutive numbers and the first group must start with 1. There are also rules for the following groups: 1. The first number follows the last number from the previous group (left), or 2. The group's numbers entirely consists of the previous group's last number. The number of numbers in each group doesn't change no matter how the numbers change inside the group (clumsy). How many combinations are there for 1. 111111 2. 11111111 ?

This Question is Closed

LollyLau
 4 years ago
Best ResponseYou've already chosen the best response.0The groups can also start with 1, creating another "run".
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.