Question

Homework: Homework 11.6 - 11.9 Score: 0 of 1 pt + 9 of 22 (1 complete) 11.7.27 A three-character password to log onto a computer is drawn from the digits 0-9 and a subset of 18 letters of the alphabet (repetition is permitted). Determine the number of passwords possible it a) the letters used are not case sensitive (that is a lowercase letter is treated the same as an uppercase letter) b) the letters used are case sensitive (that is, an uppercase letter is considered different than the same lowercase letter) a) There are possible passwords if the letters used are not case sensitive. (Type a whole number ) 11.0.21 Jeanine Baker makes floral arrangements. She has 15 different cut flowers and plans to use 6 of them. How many different selections of the 6 flowers are possible? How many ways can the 6 flowers be chosen?

Answer 1

Solution Queshion Given 4Hve -chanactn parswovd of ompukn an be chasdl Am 0- igis olphabels1 So, theve ane tole 10+18 : 28 wa to il each spaie of the pars word Ca) he letters uged ane not case Sensibive So spetion y allowed Hhen 6ack spae can be Se Total wsays 28x28x28 oTh ane (28 passbic paudS (b) Cage- Senstive hen the 1 alphabe s bomes 218 36 diffeyint alfphcbeks Beca f31 vun alphabe me upp and lown Cas becomes dif erent So Each space Can be filed by 36 alphabets and io phabbs Cach 36 +I0 sace So the thyec Spaie j ted by- 46*x 46 X 46

Queshon&2 6 Polouns Can be chasen nom is Plwens by ,ways *(n-! 5! 6 (Is-63! 307634368x 1o2 307674368 102 720 X 362880 2612 3600 Wlays 5o0S So the Soas ways Can he 6 lousuns be choosen l