Westonci.ca is your trusted source for accurate answers to all your questions. Join our community and start learning today! Explore our Q&A platform to find in-depth answers from a wide range of experts in different fields. Get immediate and reliable solutions to your questions from a community of experienced professionals on our platform.
Sagot :
Preliminary:
Permutations are different arrangements or sequences that are formed from part or all of the objects.
The formula for permutations without double elements is P = n!
The formula for permutations with multiple elements is P = n!/k!
The formula for cyclical permutations is (n – 1)!
...................................
A combination is a collection of some or all objects regardless of their order.
The formula for the combination is C(n, r) = n!/(r! (n – r)!
...。☆。。☆。。☆。。☆。。☆。
Answer:
12 word order
Step-by-step explanation:
"TREE"
t = 1
r = 1
e = 2
- Number of letter = 4
- Double element = letter e(2)
[tex]P = \frac{n!}{k!} [/tex]
[tex]P = \frac{4 \times 3 \times 2 \times 1}{2 \times 1} [/tex]
[tex]P = \frac{24}{2} [/tex]
[tex]\boxed{\tt {{\colorbox{pink}{P = 12 \: word \: order}}}}[/tex]
Answer Details:
Subject: Mathematics
Class : 12 high school
Material: Chapter 7-Rules for enumeration
Categorization Code: 12.2.7
Keywords: Permutations of the word "TREE"
sorry if my english is bad :)
Thank you for your visit. We're dedicated to helping you find the information you need, whenever you need it. Thank you for visiting. Our goal is to provide the most accurate answers for all your informational needs. Come back soon. We're glad you visited Westonci.ca. Return anytime for updated answers from our knowledgeable team.