When a histogram is used to represent data, the individual data values are not retained.
I would say the answer is 7, since 21 divided by 3 is 7 and there are 1/3 as many of them
Answer:
a = 2
Step-by-step explanation:
Note that a point uses (x , y).
y = 1
x = a
Plug in 1 for y in the equation, and a for x:
y = 3x - 5
1 = 3a - 5
Isolate the variable, a. Note the equal sign, what you do to one side, you do to the other. Do the opposite of PEMDAS.
First add 5 to both sides:
1 (+5) = 3a - 5 (+5)
1 + 5 = 3a
6 = 3a
Next, divide 3 from both sides:
(6)/3 = (3a)/3
a = 6/3
a = 2
2 is your value for a.
~
Answer:
y =(t-r)/s
Step-by-step explanation:
r + sy = t
Subtract r from both the sides,
sy = t - r
Divide both the sides by s,
y = (t - r) / s
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
