Assume N students
Student 1 can get (n-1) papers
Student 2 can get (n-1) papers
Student 3 can get (n-1) papers
etc
Student N can get (n-1) papers
So for N students you can have N(n-1)
Answer:
504 combos
Step-by-step explanation:
Cannot use digits twice and last is '7'
9 digits for first place choice
8 digits for second place
7 digits for third place
only '7' for fourth place 9 x 8 x7 = 504 combos
Answer:
2226
Step-by-step explanation:
2 times a number minus 9 is less than or equal to 21. and in inequality form that’s: 2x - 9 >_ 21 and u make a number line and a closed circle on 15 and an arrow going right. i hope i understood your question right
Since the plane starts at (0,0), you don't have to factor in anything except for the translation. The plane would be at (-.5, 3.5)
