Question

How many ways the letters of the word TREE be rearranged?

Answer 1

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

Explanation:

"TREE"

t = 1

r = 1

e = 2

• Number of letter = 4
• Double element = letter e(2)

`P = (n!)/(k!)`

`P = (4 * 3 * 2 * 1)/(2 * 1)`

`P = (24)/(2)`

`\boxed{\tt {{\colorbox{pink}{P = 12 \: word \: order}}}}`

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 :)