Discrete Math, anagram combinatorics. Find the number of anagrams for the word "ALIVE" so that the letter "A" is before the letter "E" or the letter "E" is before the letter "I". By before we mean any letter previous, not just immediately before.

klepkowy7c 2022-07-15 Answered
Discrete Math, anagram combinatorics
Find the number of anagrams for the word "ALIVE" so that the letter "A" is before the letter "E" or the letter "E" is before the letter "I". By before we mean any letter previous, not just immediately before.
Any help, totally stumped on this question.
You can still ask an expert for help

Want to know more about Discrete math?

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (2)

Dominique Ferrell
Answered 2022-07-16 Author has 18 answers
Step 1
You have the word AEI and should put somewhere between its letters 2 another letters.
Step 2
There are 4 places for the first letter, _A_E_I_, and 5 places for the second letter after inserting the first. So the answer is 4 5 = 20
Did you like this example?
Subscribe for all access
Emmanuel Pace
Answered 2022-07-17 Author has 6 answers
Step 1
There are 5! ways to arrange the given letters, if there are no restrictions. But there are restrictions.
We want A before E or E before I (or both). Call such an arrangement good.
We first count the bad arrangements, in which A is after E and E is after I, so the letters come in the order I, E, A, with possibly stuff between these letters.
Step 2
The 3 locations of our key letters can be chosen in ( 5 3 ) ways. Once we have chosen therse 3 spots, which of these spots is occupied by our letters is determined. And now we can arrange the remaining 2 letters in the 2 empty slots in 2! ways, for a total of ( 5 3 ) ( 2 ! ) = 20 bad arrangements.
It follows that the number of good arrangements is 5 ! 20, that is, 100.
Did you like this example?
Subscribe for all access

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2021-08-18

Discrete Mathematics Basics

1) Find out if the relation R is transitive, symmetric, antisymmetric, or reflexive on the set of all web pages.where (a,b)R if and only if 
I)Web page a has been accessed by everyone who has also accessed Web page b.
II) Both Web page a and Web page b lack any shared links.
III) Web pages a and b both have at least one shared link.

asked 2021-08-02

Suppose that A is the set of sophomores at your school and B is the set of students taking discrete mathematics at your school. Express each of these sets in terms of A and B. 
a) the set of sophomores taking discrete mathematics in your school 
b) the set of sophomores at your school who are not taking discrete mathematics 
c) the set of students at your school who either are sophomores or are taking discrete mathematics 
Use these symbols: 

asked 2020-11-09
Use proof by Contradiction to prove that the sum of an irrational number and a rational number is irrational.
asked 2021-07-28

Let A, B, and C be sets. Show that (AB)C=(AC)(BC)
image

asked 2022-09-04
Random bipartite graph with lower bounded degrees
Let i be a positive integer and V 1 , V 2 be the vertex sets of a bipartite graph. We want to sample uniformly at random a bigraph in the set of bigraphs with vertex set V 1 V 2 such that for each v V 1 , it has at least i neighbors in V 2 and for each u V 2 , it has at least one neighbor in V 1 .
Is there any efficient way to do this?
asked 2022-06-07
Prove by Mathematical Induction 𝑎 𝑛 < 3 𝑥 ,, if 𝑎 1 = 3 , 𝑥 2 ,, and 𝑎 𝑛 + 1 = 2 ( 2 + 𝑎 𝑛 )
asked 2021-08-10
F0, F1, F2 is the Fibonacci sequence.
Prove that Fk+12Fk2=Fk1Fk+2, for all integers k1

New questions

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question