Answer: B. 1125
The answer is B because there is a special method when dividing by 3 to make sure it is actually able to be divided. You add the all the digits together, for example the digits in 1125, the total sum is 9 and if the total sum is able to be be divided by 3 then the whole number can be divided by 3.
Answer:
There can be 14,040,000 different passwords
Step-by-step explanation:
Number of permutations to order 3 letters and 2 numbers (total 5)
(AAANN, AANNA,AANAN,...)
= 5! / (3! 2!)
= 120 / (6*2)
= 10
For each permutation, the three distinct (English) letters can be arranged in
26!/(26-3)! = 26!/23! = 26*25*24 = 15600 ways
For each permutation, the two distinct digits can be arranged in
10!/(10-2)! = 10!/8! = 10*9 = 90 ways.
So the total number of distinct passwords is the product of all three permutations,
N = 10 * 15600 * 90 = 14,040,000
Answer:
3. x = 53
4. x = 60
Step-by-step explanation:
Answer:
22 + 27 = <u><em>49</em></u>
<u><em></em></u>
:) :)
5x = 4y - 3
Standard form is Ax + By = C, so first subtract 4y to both sides:
5x - 4y = -3