please check the attachment
9.
+ -/1 points HunterDM3 4.3.030.
My Notes + Ask Your Teacher
Suppose that 100 lottery tickets are given out in sequence to the first 100 guests to arrive at a party. Of these 100 tickets, only 15 are winning tickets. The generalized
pigeonhole principle guarantees that there must be a streak of at least / losing tickets in a row. Find I.
1 =
eBook
8.
+ -/1 points HunterDM3 4.3.028.
My Notes + Ask Your Teacher
A small college offers 234 different classes. No two classes can meet at the same time in the same room, of course. There are 11 different time slots at which classes can
occur. What is the minimum number of classrooms needed to accommodate all the classes?
eBook
7.
+ -/1 points HunterDM3 4.3.018.
My Notes
+ Ask Your Teacher
Suppose you have ten squares of stained glass, all of different colors, and you would like to make a rectangular stained glass window in the shape of a 2 x 5 grid.
WebAssign Plot
How many different ways can you do this, taking symmetry into account? (Note that any pattern may be rotated 180°, flipped vertically, or flipped horizontally. You should
count all the possible resulting patterns as the same window.)
eBook
Submit Answer
Save Progress
Practice Another Version
2.
+ 0/1 points | Previous Answers HunterDM3 4.3.006d.
My Notes + Ask Your Teacher
The following figure consists of 8 horizontal lines and 15 vertical lines. The goal of this problem is to count the number of rectangles (squares are a kind of rectangle, but
line segments are not).
Let V be the set of all sets of two vertical lines, and let H be the set of all sets of two horizontal lines. Let R be the set of all rectangles in the figure. Define a function
f:
RVXH by
A
с
({AB, CD}, {AC, BD}).
B
D
Compute R1, the number of rectangles in the figure.
1638
eBook
1.
+ -/1 points HunterDM3 4.3.004b.
My Notes
+ Ask Your Teach
The following 9 x 26 grid is divided into squares that are 1 unit by 1 unit.
B
А
The shortest possible path on this grid from A to B is 35 units long. One such path is shown in the figure. Let X be the set of all 35-unit-long paths from A to B.
Compute XI, the number of 35-unit-long paths from A to B.
1X1 =
eBook
Submit Answer
Save Progress
Practice Another Version
Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.
Read moreEach paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.
Read moreThanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.
Read moreYour email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.
Read moreBy sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.
Read more