How many distinct arrangements of the letters in MANANGATANG
have no A’s in the first six places?
NOTE: MANANGATANG has 11 letters, so the last five places must
have four A's and one other letter.
PLEASE SHOW FULL LEGIBLE WORKING.
1a. How many arrangements are there of all the letters in
INDIVIDUAL?
1b. How many arrangements of the letters in INDIVIDUAL have all
three I’s adjacent?
1c. How many arrangements of the letters in INDIVIDUAL have no
I’s adjacent?
1. How many four-letter arrangements can be made from 10 letters
if repetitions are NOT allowed?
2. How many four-letter arrangements can be selected from 10
letters?
Consider four-digit numbers that consist of 0, 1, 2, 5, 6, and
9.
a) How many four-digit numbers can be formed from the digits 0, 1,
2, 5, 6, and 9 if each digit can be used
only once? (the four-digit numbers can't start with 0).
b) How many of those four-digit numbers are even?
c) How many are greater than 2200?
How many distinct arrangements of the letters in MANANGATANG are
there in which the first two letters include an M or a T (or
both)?
Note:
- MANANGATANG has 11 letters (one M,
one T, two Gs, three Ns and four As).
- These are all the possible positionings of T and M in the
first two positions:
M
M
T
T
M
T
T
M
PLEASE SHOW FULL LEGIBLE WORKING.
Password consists of five characters: one lowercase letter and
four digits 0 – 9.
How many possible combinations for the password are there if
digits can be repeated?
How many possible combinations for the password are there if
digits can not be repeated?
What is a percentage of passwords with repeated digits?
How many arrangements of INCONSISTENT are there in which NE
appear consecutively or NO appear consecutively but not both NE and
NO are consecutive?
The answer is 2x11!/2!2!2!2! - 2x10!/2!2!2!
Please show me how to get the answer, it's important for my
midterm, thanks.
2. An 8-digit password is required to have three 0’s and five
1’s. You will determine how many unique passwords are possible.
First consider how you might notate possible outcomes in the
process of listing them. For example, any of the following can
represent the same outcome: 01011101 137 (the digits are the
locations of the 0’s) 24568 (the digits are the locations of the
1’s) Write a program that lists and counts the unique passwords.
Provide your code, all...