How many 3-element lists can be formed whose entries are drawn from a pool of n possible elements if we require that the first and last entries of the list must be the same? How many such lists can be formed if we require that the first and last entries must be different? (In both cases, there is no restriction on the middle entry in the list.)
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here