Module 3 Problem Set

pdf

School

Southern New Hampshire University *

*We aren’t endorsed by this school

Course

230

Subject

Sociology

Date

Jun 3, 2024

Type

pdf

Pages

8

Uploaded by kennedyglidden616

Report
MODULE THREE PROBLEM SET This document is proprietary to Southern New Hampshire University. It and the problems within may not be posted on any non-SNHU website. Kennedy Glidden 1
Directions: Type your solutions into this document and be sure to show all steps for arriving at your solution. Just giving a final number may not receive full credit. Problem 1 A 125-page document is being printed by five printers. Each page will be printed exactly once. (a) Suppose that there are no restrictions on how many pages a printer can print. How many ways are there for the 125 pages to be assigned to the five printers? One possible combination: printer A prints out pages 2-50, printer B prints out pages 1 and 51-60, printer C prints out 61-80 and 86-90, printer D prints out pages 81-85 and 91-100, and printer E prints out pages 101-125. Since there are 125 pages, there are 125 elements in the set. There are 5 printers, so we will perform a 5 permutation. 125! 5!120! = 234 , 531 , 275 There are 234,531,275 possible combinations. (b) Suppose the first and the last page of the document must be printed in color, and only two printers are able to print in color. The two color print- ers can also print black and white. How many ways are there for the 125 pages to be assigned to the five printers? There are 2 pages to be printed in color, and there are 2 possible printer options, so 2 2 . There are 123 pages to print in black and white, and 5 printer options, so 5 123 . 2 2 * 5 123 = 3.76 * 10 86 possible combinations. (c) Suppose that all the pages are black and white, but each group of 25 con- secutive pages (1-25, 26-50, 51-75, 76-100, 101-125) must be assigned to the same printer. Each printer can be assigned 0, 25, 50, 75, 100, or 125 pages to print. How many ways are there for the 125 pages to be assigned to the five printers? There are 5 groups in the set, and 5 printer options, so 5 5 = 3125 pos- sible combinations
Problem 2 Ten kids line up for recess. The names of the kids are: { Alex, Bobby, Cathy, Dave, Emy, Frank, George, Homa, Ian, Jim } . Let S be the set of all possible ways to line up the kids. For example, one order might be: (Frank, George, Homa, Jim, Alex, Dave, Cathy, Emy, Ian, Bobby) The names are listed in order from left to right, so Frank is at the front of the line and Bobby is at the end of the line. Let T be the set of all possible ways to line up the kids in which George is ahead of Dave in the line. Note that George does not have to be immediately ahead of Dave. For example, the ordering shown above is an element in T . Now define a function f whose domain is S and whose target is T . Let x be an element of S , so x is one possible way to order the kids. If George is ahead of Dave in the ordering x , then f ( x ) = x . If Dave is ahead of George in x , then f ( x ) is the ordering that is the same as x , except that Dave and George have swapped places. (a) What is the output of f on the following input? (Frank, George, Homa, Jim, Alex, Dave, Cathy, Emy, Ian, Bobby) Since George is ahead of Dave, the output remains the same as the in- put. (Frank, George, Homa, Jim, Alex, Dave, Cathy, Emy, Ian, Bobby) (b) What is the output of f on the following input? (Emy, Ian, Dave, Homa, Jim, Alex, Bobby, Frank, George, Cathy) Since Dave is a head of George, the must swap places, leaving the out- put at (Emy, Ian, George, Homa, Jim, Alex, Bobby, Frank, Dave, Cathy) (c) Is the function f a k -to-1 correspondence for some positive integer k ? If so, for what value of k ? Justify your answer. No, there is not a k to 1 correspondence as the order of George and Dave matter. (d) There are 3628800 ways to line up the 10 kids with no restrictions on who comes before whom. That is, | S | = 3628800. Use this fact and the answer to the previous question to determine | T | . Since T is a subset of S (bijection) we can use the k to 1 rule.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help
Problem 3 Consider the following definitions for sets of characters: Digits = { 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } Letters = { a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z } Special characters = {* , & , $ , # } Compute the number of passwords that satisfy the given constraints. (i) Strings of length 7. Characters can be special characters, digits, or letters, with no repeated characters. There are 40 total different characters. Thus: 40 * 39 * 38 * 37 * 36 * 35 * 34 = 93,963,542,400 different combinations. (ii) Strings of length 6. Characters can be special characters, digits, or letters, with no repeated characters. The first character can not be a special char- acter. There are 36 options for the first character and 39 options for the 2nd character. Thus: 36*39*38*37*36*35 = 2,487,270,240 different combina- tions.
Problem 4 A group of four friends goes to a restaurant for dinner. The restaurant offers 12 different main dishes. (i) Suppose that the group collectively orders four different dishes to share. The waiter just needs to place all four dishes in the center of the table. How many different possible orders are there for the group? Since each person gets a different dish, the first person has 12 options, the second person has 11, the third has 10, and the fourth has 9. Thus: 12*11*10*9 = 11,880 different combinations. (ii) Suppose that each individual orders a main course. The waiter must re- member who ordered which dish as part of the order. It’s possible for more than one person to order the same dish. How many different possible orders are there for the group? Since they all can each get the same dish if they would like, they each have 12 options to select from. Thus: 12*12*12*12 = 20,736 different com- binations How many different passwords are there that contain only digits and lower-case letters and satisfy the given restrictions? (iii) Length is 7 and the password must contain at least one digit. There are 36 total characters if a digit is used. There are 26 if digits are not used. Since we are considering at least one digit, we will solve considering only one digit. Thus: 36 7 - 26 7 = 70,332,353,920 combinations. (iv) Length is 7 and the password must contain at least one digit and at least one letter. There are 36 total characters. There are 10 digits, and 26 characters. Thus: 36 7 - (26 7 + 10 7 ) = 70,322,353,920 combinations
Problem 5 A university offers a Calculus class, a Sociology class, and a Spanish class. You are given data below about two groups of students. (i) Group 1 contains 170 students, all of whom have taken at least one of the three courses listed above. Of these, 61 students have taken Calculus, 78 have taken Sociology, and 72 have taken Spanish. 15 have taken both Cal- culus and Sociology, 20 have taken both Calculus and Spanish, and 13 have taken both Sociology and Spanish. How many students have taken all three classes? Lets define our variables: c=Calculus s=Sociology sp=Spanish We are looking to find c and s and sp. Since we are only looking for how man students took all three classes, we can subtract our students who took only one or two. Thus: 170 = 61 + 78 + 72 - 15 - 20 - 13 + ( c s sp ). 170 = 163( c s sp ). 7 Students have taken all three courses. (ii) You are given the following data about Group 2. 32 students have taken Calculus, 22 have taken Sociology, and 16 have taken Spanish. 10 have taken both Calculus and Sociology, 8 have taken both Calculus and Span- ish, and 11 have taken both Sociology and Spanish. 5 students have taken all three courses while 15 students have taken none of the courses. How many students are in Group 2? c=calculus s=sociology sp=spanish n = 32 + 22 + 16 - 10 - 8 - 11 + 2 * n ( c s sp ) n = 41 + 2 * n ( c s sp ) n = 41 + 2 x Since we do not know the value of x, it is not possible to determine the number of students in group 2.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help
Problem 6 A coin is flipped five times. For each of the events described below, express the event as a set in roster notation. Each outcome is written as a string of length 5 from { H, T } , such as HHHTH . Assuming the coin is a fair coin, give the proba- bility of each event. (a) The first and last flips come up heads. There are 32 possible outcomes in the sample space. Of those, 8 start and end with heads. Thus: 8/32 =0.25 There is a 25% probability of flipping heads on both the first and last flip. (b) There are at least two consecutive flips that come up heads. Since we are looking for at least 2 consecutive head flips, we must also consider 3, 4, and 5 consecutive head flips. Thus,the probability of flipping two consecutive heads = p(2 consecutive heads)+p(3 consecutive heads)+p(4 consecutive heads) + p(5 consecutive heads). 19/32= 59% probability of flippng heads at least two times in a row. (c) The first flip comes up tails and there are at least two consecutive flips that come up heads. There are 8 instances where these specifications are met in the same set, out of a total 32. Thus: 8/32= 25% probability
Problem 7 An editor has a stack of k documents to review. The order in which the doc- uments are reviewed is random with each ordering being equally likely. Of the k documents to review, two are named “Relaxation Through Mathematics” and “The Joy of Calculus.” Give an expression for each of the probabilities below as a function of k. Simplify your final expression as much as possible so that your answer does not include any expressions in the form a b . (a) What is the probability that “Relaxation Through Mathematics” is first to review? Since there are k total documents, k will be our denominator. Each docu- ment has an equal probability, so 1 will represent 1 document. Thus, 1/k is the probability. (b) What is the probability that “Relaxation Through Mathematics” and “The Joy of Calculus” are next to each other in the stack? Each has a 1/k chance of being selected. The chances of one being picked AND the other is (1 /k ) * (1 /k ) = 1 k 2