1-8=1 easy math but heres help
It is the last numbers I'm positive
The number of permutations of the 25 letters taken 2 at a time (with repetitions) is:

The number of permutations of the 9 digits taken 4 at a time (with repetitions) is:

Each permutation of letters can be taken with each permutation of digits, therefore the total number of possible passwords is:
Answer: n = 4
Step-by-step explanation: you combine the like variables which turns it into
(4y - 3)
(4y - 3) is <em>another</em> way of saying ((4 x y) - 3)
So the 4 is turned into n making it (ny - 3)
I will do Point A carefully, The others I will indicate. Start with the Given Point A. Then do the translations
A(-1,2) Original Point
Reflection: about x axis:x stays the same; y becomes -y:Result(-1,-2)
T<-3,4>: x goes three left, y goes 4 up (-1 - 3, -2 + 4): Result(-4,2)
R90 CCW: Point (x,y) becomes (-y , x ) So (-4,2) becomes(-2, - 4): Result (-2, - 4)
B(4,2) Original Point
- Reflection: (4, - 2)
- T< (-3,4): (4-3,-2 + 4): (1 , 2)
- R90 CCW: (-y,x) = (-2 , 1)
C(4, -5) Original Point
- Reflection (4,5)
- T<-3,4): (4 - 3, 5 + 4): (1,9)
- R90, CCW (-9 , 1)
D(-1 , -5) Original Point
- Reflection (-1,5)
- T(<-3,4): (-1 - 3, 5 + 4): (-4,9)
- R90, CCW ( - 9, - 4)
Note: CCW means Counter Clockwise
The graph on the left is the same one you have been given.
The graph on the right is the same figure after all the transformations