Permu is the guy

\[\Large 1,2,3,4,5\]

If each digit is used exactly once, how many ways can the 5 digits above be arranged so that \(2\) and \(4\) are not adjacent?

×

Problem Loading...

Note Loading...

Set Loading...