Welcome to Bytelearn!

Let’s check out your problem:

A small college with $1,200$ total students has a student government of $40$ members. From its members, the student government will elect a president, vice president, secretary, and treasurer. No single member can hold more than $1$ of these $4$ positions. $\newline$The permutation formula $nPr$ can be used to find the number of unique ways the student government can arrange its members into these positions. $\newline$What are the appropriate values of $n$ and $r$?$\newline$$n=$ $\square$$\newline$$r=$ $\square$