Question

There are 10 letters - a, b, c, d, e, f, g, h, n, g. I...

There are 10 letters - a, b, c, d, e, f, g, h, n, g. I have to arrange them in a way that "a" wouldn't be near "c" and also "a" wouldn't be near "g" How many possible combinations are possible? How to solve it mathematically?

0 0
Add a comment Improve this question Transcribed image text
Answer #1

We have 10 letters of which be arranged in 10! / 2! = 1814400 ways ( since "G" comes twice)

Now to  arrange them in such a way that "A" wouldn't be near "C" and also "A" wouldn't be near "G".

Now assume that "AC" is a single letter. So that we now have 9 letters. we can arrange these 9 letters in 9!/2! ways. Now A & C can be arranged as AC & CA, so end up having 2 x 9!/2! = 9! arrangements where A & C appear together.

Similarly wehave 9! arrangements where A & G appear together.

So, the arrangement  that "A" wouldn't be near "C" and also "A" wouldn't be near "G" = 10!/2! - 9! - 9!

= 1088640 ways

Add a comment
Know the answer?
Add Answer to:
There are 10 letters - a, b, c, d, e, f, g, h, n, g. I...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  •       -       A.       B.       C.       D.       E.       F.       G.       H.       I.       J.       K.     ...

          -       A.       B.       C.       D.       E.       F.       G.       H.       I.       J.       K.       L.       M.       N.       O.    Telecommuting       -       A.       B.       C.       D.       E.       F.       G.       H.       I.       J.       K.       L.       M.       N.       O.    Change       -       A.       B.       C.       D.       E.       F.       G.       H.       I.       J.       K.       L.       M.       N.       O.    Job Sharing       -       A.       B.       C.       D.       E.       F.       G.       H.       I.       J.       K.       L.       M.       N.       O.    Job Redesign       -       A.       B.       C.       D.       E.       F.       G.       H.       I.      ...

  • Let G-(V,E), where V a, b, c,d,e,f.g,h and E- lla, b], [a,c), tb, c),{b,d), [b, g],...

    Let G-(V,E), where V a, b, c,d,e,f.g,h and E- lla, b], [a,c), tb, c),{b,d), [b, g], lc, d), se. f, se. g),if,g),if,h], lg, h)). (a) Draw the corresponding graph with no edges crossing. (b) How many paths are there in G from a to h'? (c) How many of these paths have length less than 5? List them.

  • A chromosome with genetic markers A, B, C, D, E, F, G, H, I and J...

    A chromosome with genetic markers A, B, C, D, E, F, G, H, I and J ( “*” represents the centromere ) is shown below: A B C D E * F G H I J Another chromosome is found to contain a b c d i h g f * e j If these two chromosomes are paired during meiosis, a single crossover takes place between F and G, and another single crossover takes place between H and I....

  • Let A = { a, b, c, d, e, f} , B={c, d, e, f, g,...

    Let A = { a, b, c, d, e, f} , B={c, d, e, f, g, h} and C= {a, c, d, f, h, i, j} i. A N (BNC) ii. A UBUC iii.(AUB) O C iv.(AN BU C

  • 4. R(A, B, C, D, E, F, G, H, I, J) where A → B, C,...

    4. R(A, B, C, D, E, F, G, H, I, J) where A → B, C, D BE F→ G, H, I (A, F) → B, C, D, E, G, H, I, J For each of the following relations, normalize it into a set of BCNF relations.

  • 5. Eight letters {A, B, C, D, E, F,G,H} appear in a 100 letter length message...

    5. Eight letters {A, B, C, D, E, F,G,H} appear in a 100 letter length message with the following frequencies: 22, 6, 13, 19, 2, 9, 25, 4. (a) Use Huffman tree to design an optimal binary prefix code for the letters. (b) What is the average bit length of the message after apply codes designed in (a) to the message? [20 marks]

  • Please prove C D E F in details? 'C. Let G be a group that is...

    Please prove C D E F in details? 'C. Let G be a group that is DOE smDe Follow the steps indicated below; make sure to justify all an Assuming that G is simple (hence it has no proper normal subgroups), proceed as fo of order 90, The purpose of this exercise is to show, by way of contradiction. How many Sylow 3sukgroups does G have? How many Sylow 5-subgroups does G ht lain why the intersection of any two...

  • Let U ={a, b, c, d, e, f, g, h, i, j, k}. Let A={d, f,...

    Let U ={a, b, c, d, e, f, g, h, i, j, k}. Let A={d, f, g, h, i, k}. Let B={a, d, f, g, h}. Let C={a, c, f. i, k} Determine (AUC) U ( AB). Choose the correct answer below and, if necessary, fill in the answer box in your choice. OA. (AUC) U(ANB)= } (Use a comma to separate answers as needed.) OB. (A'UC) U (ANB) is the empty set. LE This Question: 1 pt Let U={x|XEN...

  • 5. (3, 4, 3 points) Let A-a, b, c, d, e, f, g (a) how many closed binary operations f on A satisfy Aa, b)tc b) How many closed binary operations f on A have an identity and a, b)-c? (c) How many...

    5. (3, 4, 3 points) Let A-a, b, c, d, e, f, g (a) how many closed binary operations f on A satisfy Aa, b)tc b) How many closed binary operations f on A have an identity and a, b)-c? (c) How many fin (b) are commutative? 6. 10 points) Suppose that R and R are equivalent relations on the set S. Determine whether each of the following combinations of R and R2 must be an equivalent relation. (a) R1...

  • Let A={a b c d e f} B={a c e g} C = {b d f}...

    Let A={a b c d e f} B={a c e g} C = {b d f} Find each: B = {a, c, e,g} C = {b,d,f} A= {a,b,c,d,e,f} Find: (2 points each) (a) AnB (b) AUB (c) Ang (d) COB (e) CUB (f) (An B)UC (g) An(BUC) (h) Ax B (i) C XB G) AB (k) C ( BA) (1) B2

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT