Exam 6: Counting

arrow
  • Select Tags
search iconSearch Question
  • Select Tags

Use the binomial theorem to prove the following: 3100=(1000)+(1001)⋅2+(1002)⋅22+(1003)⋅23+⋯+(10099)⋅299+(100100)⋅21003 ^ { 100 } = \left( \begin{array} { c } 100 \\0\end{array} \right) + \left( \begin{array} { c } 100 \\1\end{array} \right) \cdot 2 + \left( \begin{array} { c } 100 \\2\end{array} \right) \cdot 2 ^ { 2 } + \left( \begin{array} { c } 100 \\3\end{array} \right) \cdot 2 ^ { 3 } + \cdots + \left( \begin{array} { c } 100 \\99\end{array} \right) \cdot 2 ^ { 99 } + \left( \begin{array} { c } 100 \\100\end{array} \right) \cdot 2 ^ { 100 }

(Short Answer)
4.7/5
(73)

In questions consider all bit strings of length 12. -How many begin with 110?

(Short Answer)
4.8/5
(84)

(a) In how many ways are there to arrange the letters of the word NONSENSE? (b) How many of these ways start or end with the letter O?

(Short Answer)
4.9/5
(67)

Show that in a group of ten people (where any two people are either friends or enemies) there are either three mutual friends or four mutual enemies.

(Short Answer)
4.8/5
(82)

In questions let A be the set of all strings of decimal digits of length five. For example 00312 and 19483 are strings in -Find |A|.

(Short Answer)
4.8/5
(84)

Use the binomial theorem to expand (x−3x)5\left( x - \frac { 3 } { x } \right) ^ { 5 }

(Short Answer)
4.8/5
(66)

Findodd. the number of subsets of S = {1, 2, 3, . . . , 10} that contain exactly four elements, the sum of which is

(Short Answer)
4.9/5
(92)

In how many ways can you get a bunch of four books to give to a friend?

(Short Answer)
4.8/5
(87)

In questions consider all bit strings of length 12. -How many begin with 11 or end with 10?

(Short Answer)
4.8/5
(76)

In questions suppose that a "word" is any string of seven letters of the alphabet, with repeated letters allowed. -How many words begin with A or B or end with A or B?

(Short Answer)
4.9/5
(82)

The figure at the right shows a 4-block by 5-block grid of streets. to point B, where at each stage you can only go right or up. Find the number of ways in which you can go from point A The figure at the right shows a 4-block by 5-block grid of streets. to point B, where at each stage you can only go right or up. Find the number of ways in which you can go from point A   (You are not allowed to go left or down.) For example, one allowable route from A to B is: Right, Right, Up, Right, Up, Up, Right, Right, Up. (You are not allowed to go left or down.) For example, one allowable route from A to B is: Right, Right, Up, Right, Up, Up, Right, Right, Up.

(Short Answer)
4.8/5
(67)

Find the next largest permutation in lexicographic order after 3254781.

(Short Answer)
4.8/5
(77)

Using the ordinary alphabet and allowing repeated letters, find the number of words of length 8 that begin and end with T.

(Short Answer)
4.8/5
(68)

Find the largest coefficient in the expansion of (x+3)5( x + 3 ) ^ { 5 } .

(Short Answer)
4.9/5
(80)

Find the next largest permutation in lexicographic order after 1324.

(Short Answer)
4.8/5
(76)

In questions suppose that a "word" is any string of seven letters of the alphabet, with repeated letters allowed. -How many words end with the letter T?

(Short Answer)
4.8/5
(80)

Find the number of subsets of S = {1, 2, 3, . . . , 10} that contain both 5 and 6.

(Short Answer)
4.8/5
(63)

Find the number of permutations of the letters in the word CORRECT.

(Short Answer)
5.0/5
(90)

In questions suppose you have a class with 30 students - 10 freshmen, 12 sophomores, and 8 juniors. -In how many ways can you put all students in a line so that the freshmen are first, the sophomores are in the middle, and the juniors are at the end?

(Short Answer)
4.8/5
(84)

Suppose ∣A∣| A | =4 and ∣B∣| B | =10 . Find the number of functions f:A→Bf : A \rightarrow B

(Short Answer)
4.8/5
(78)
Showing 121 - 140 of 156
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)