EN g00092844@aus.

edu
(Sign out)
Home My Assignments Grades
Communication Calendar
My eBooks

Discrete Math Fall 2023, Fall 2023

INSTRUCTOR
HW-9-F23 (Homework) Abdul Jarrah
University of Sharjah

Current Score

QUESTION 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 1

POINTS 2/2 5/5 1/1 3/3 4/4 4/4 6/6 1/1 2/2 4/4 2/2 2/3 5/6 2/2 1/1 1/1 3/3 6/6 2

TOTAL SCORE

65/65 100.0%

Due Date Past Due

SUN, NOV 12, 2023

12:59 AM GMT+5

Request Extension

Assignment Submission & Scoring

Assignment Submission
For this assignment, you submit answers by questions. You are required to use a new randomization after every 1 question
submissions.
Assignment Scoring
Your last submission is used for your score.

The due date for this assignment has passed.

Your work can be viewed below, but no changes can be made.

Important! Before you view the answer key, decide whether or not you plan to request an extension. Your Instructor may
not grant you an extension if you have viewed the answer key. Automatic extensions are not granted if you have viewed
the answer key.

Request Extension View Key

Consider the sample space given below.

A die is a cube with six sides and each side contains one to six dots. Suppose a blue die and a gray die are rolled together, and the numbers of dots that
occur face up on each are recorded. The possible outcomes of the sample space S are listed as follows, where in each case the die on the left is blue
and the one on the right is gray.

S = {11, 12, 13, 14, 15, 16, 21, 22, 23, 24, 25, 26, 31, 32, 33, 34, 35, 36,
41, 42, 43, 44, 45, 46, 51, 52, 53, 54, 55, 56, 61, 62, 63, 64, 65, 66}

Write the following event as a set. (Enter your answer in roster notation. Enter EMPTY or ∅ for the empty set.)

The event that the sum of the numbers showing face up is at least 9.

E=
$${36,45,54,63,46,55,64,56,65,66}

Compute its probability.

5/18

Show My Work (Optional)

Suppose that in a certain state, all automobile license plates have three uppercase letters followed by four digits.

(a) How many different license plates are possible?

175760000

(b) How many license plates could begin with A and end in 0?
676000

(c) How many license plates could begin with QFG?

10000

(d) How many license plates are possible in which all the letters and digits are distinct?
78624000

(e) How many license plates could begin with AB and have all letters and digits distinct?
120960

Show My Work (Optional)

Let T = {1, 2, 3, 4, 5, 6, 7, 8, 9}. Suppose five integers are chosen from T. Show that it is not true that there must be two integers whose sum is 10 by
giving a counterexample. In other words, fill in the blank with five numbers from T, no two of which have a sum of 10. (Enter your answer in set-roster
notation.)

$${1,2,3,4,5}

Show My Work (Optional)

(a) How many ways can the letters of the word MAILBOX be arranged in a row?
5040

(b) How many ways can the letters of the word MAILBOX be arranged in a row if M and A must remain together (in order) as a unit?
720

(c) How many ways can the letters of the word MAILBOX be arranged in a row if the letters ILB must remain together (in order) as a unit?
120

Show My Work (Optional)

At a certain company, passwords must be from 4–6 symbols long and composed from the 26 uppercase letters of the Roman alphabet, the ten digits
0–9, and the 14 symbols !, @, #, $, %, ^, &, *, (, ), −, +, {, and }.

(a) How many passwords are possible if repetition of symbols is allowed?

15943750000

(b) How many passwords contain no repeated symbols?

11701082400

(c) How many passwords have at least one repeated symbol?

4242667600

(d) What is the probability that a password chosen at random has at least one repeated symbol? (Round your answer to the nearest tenth of a
percent.)
26.6 %

Show My Work (Optional)

If n + 1 integers are chosen from the set

{1, 2, 3, , 2n},

where n is a positive integer, must at least one of them be even? Why?

Yes . Let S = {1, 2, 3, , 2n}, where n is a positive integer, and note that in S there are exactly
$$n

odd integers. Since n + 1 is greater than the number of odd integers in T, it is necessary for at least one of the elements of T to be
even.

Show My Work (Optional)

(a) If 13 cards are randomly selected from a standard 52-card deck, must at least 2 be of the same denomination (2, 3, 4, , J, Q, K, A)? Why?
(Select all that apply.)

Yes. For example, six hearts: 2, 3, 4, 5, 6, 7, and seven diamonds: 2, 3, 4, 5, 6, 7, 8, could be selected. Six of these are of the same
denomination.

No. For example, the 2, 4, 6 of hearts, the 5, 10, K of diamonds, the 8, 9, J, A of clubs, and the 3, 7, Q of spades have no two cards that
are of the same denomination.

No. For example, six hearts: 2, 3, 4, 5, 6, 7, and seven diamonds: 2, 3, 4, 5, 6, 7, 8, could be selected. Six of these are of the same
denomination.

No. For example, thirteen hearts could be selected: 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, A. No two of these are of the same denomination.

No. For example, thirteen hearts could be selected: 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, A. At least two of these are of the same
denomination.

(b) If 20 cards are randomly selected from a standard 52-card deck, must at least 2 be of the same denomination (2, 3, 4, ..., J, Q, K, A)? Why?

Yes . Let A be the set of 20 cards selected from the 52-card deck, and let B be the 13 different denominations of cards in the deck. If
we construct a function from A to B, then by the pigeonhole principle, the function must be not a one-to-one correspondence .
Therefore, it is impossible to randomly select 20 cards with no repeated denomination from a standard 52-card deck.

Show My Work (Optional)

Seven new employees, two of whom are married to each other, are to be assigned seven desks that are lined up in a row. If the assignment of
employees to desks is made randomly, what is the probability that the married couple will have nonadjacent desks? (Hint: The event that the couple
have nonadjacent desks is the complement of the event that they have adjacent desks.) (Round your answer to the nearest tenth of a percent.)
71.4 %

Show My Work (Optional)

Consider strings of length n, n ≥ 1, over the set {a, b, c, d}.

(a) How many such strings contain at least one pair of adjacent characters that are the same?
$$4n−4·3n−1

(b) If a string of length seven over {a, b, c, d} is chosen at random, what is the probability that it contains at least one pair of adjacent characters that
are the same? (Round your answer to the nearest tenth of a percent.)
82.2 %

Show My Work (Optional)

(a) A bit string is a finite sequence of 0's and 1's. How many bit strings have length 7?
128 bit strings

(b) How many bit strings of length 7 begin with three 0's?

If a bit string of length 7 begins with three 0's, then 4 positions remain to be filled in. Since each of these positions can be filled with either
a 0 or a 1, the number of bit string of length 7 that begin with three 0's is 16 .

(c) How many bit strings of length 7 begin and end with a 1?
32 bit strings

Show My Work (Optional)

(a) How many ways can the letters of the word BECOMING be arranged in a row?
40320

(b) How many ways can the letters of the word BECOMING be arranged in a row if B and E must remain next to each other as either BE or EB?

10080 .

(Hint: See Exercise 9.3.11 with its solution in the "Read It" link.)

Show My Work (Optional)

 (a) How many integers from 1 through 1,000 are multiples of 4 or multiples of 3?
500

(b) Suppose an integer from 1 through 1,000 is chosen at random. Use the result of part (a) to find the probability that the integer is a multiple of 4
or a multiple of 3. (Round to the nearest tenth of a percent.)
0.5

(c) How many integers from 1 through 1,000 are neither multiples of 4 nor multiples of 3?
500

Show My Work (Optional)

(a) Given any set of seven integers, must there be at least two that have the same remainder when divided by 6?

To answer this question, let A be the set of 7 distinct integers and let B be the set of all possible remainders that can be obtained when an
integer is divided by 6, which means that B has 6 elements. Hence, if a function is constructed from A to B that relates each of the integers
in A to its remainder, then by the pigeonhole principle, the function is not one-to-one . Therefore, for the set of integers in A, it is
impossible for all the integers to have different remainders when divided by 6. So, the answer to the question is yes .

(b) Given any set of seven integers, must there be at least two that have the same remainder when divided by 8? If the answer is yes, enter YES. If
the answer is no, enter a set of seven integers, no two of which have the same remainder when divided by 8.
$$1,2,3,4,5,6,7

Show My Work (Optional)

If n is a positive integer, how many integers from 0 through 2n must you pick in order to be sure of getting at least one that is odd?

$$n+2

How many integers must be picked in order to be sure of getting at least one that is even?

$$n+1

Show My Work (Optional)

 What is the minimum number of integers that must be picked in order to be sure that at least two of them have the same remainder when divided by 8?

Show My Work (Optional)

A penny collection contains twelve 1967 pennies, seven 1968 pennies, and eleven 1971 pennies. If you are to pick some pennies without looking at the
dates, how many must you pick to be sure of getting at least six pennies from the same year?

16

Show My Work (Optional)

17. [3/3 Points] DETAILS PREVIOUS ANSWERS EPPDISCMATH5M 9.1.022. 1/2 Submissions Used

MY NOTES ASK YOUR TEACHER

(a) How many positive three-digit integers are multiples of 6?

150

(b) What is the probability that a randomly chosen positive three-digit integer is a multiple of 6?
150/900

(c) What is the probability that a randomly chosen positive three-digit integer is a multiple of 7?
128/900

Show My Work (Optional)

 (a) How many integers are there from 1,000 through 9,999?
9000

(b) How many odd integers are there from 1,000 through 9,999?
4500

(c) How many integers from 1,000 through 9,999 have distinct digits?
4536

(d) How many odd integers from 1,000 through 9,999 have distinct digits?
2240

(e) What is the probability that a randomly chosen four-digit integer has distinct digits?
63/125

What is the probability that a randomly chosen four-digit integer has distinct digits and is odd?
56/225

Show My Work (Optional)

Two faces of a six-sided die are painted red, two are painted blue, and two are painted yellow. The die is rolled three times, and the colors that appear
face up on the first, second, and third rolls are recorded.

(a) Find the probability of the event that exactly one of the colors that appears face up is red.
4/9

(b) Find the probability of the event that at least one of the colors that appears face up is red.
19/27

Show My Work (Optional)

A group of seven people are attending the movies together.

(a) Two of the seven insist on sitting side-by-side. In how many ways can the seven be seated together in a row?
1440

(b) Two of the people do not like each other and do not want to sit side-by-side. Now how many ways can the seven be seated together in a row?
3600

Show My Work (Optional)

In a group of 700 people, must there be 2 who have matching first and last initials? Why? (Assume each person has a first and last name.)

Yes . Let A be the set of 700 distinct people and let B be the 676 different unique combinations of first and last initials. If we construct a
function from A to B, then by the pigeonhole principle, the function must be not a one-to-one correspondence . Therefore, in a group of
700 people, it is impossible that no two people have matching first and last initials.

Show My Work (Optional)

Question 1 of 21 View Next Question

Home My Assignments Request Extension

Copyright © 1998 - 2023 Cengage Learning, Inc. All Rights Reserved TERMS OF USE PRIVACY