AIME II 2018 problem 11

For discussing Olympiad Level Combinatorics problems
User avatar
samiul_samin
Posts: 1004
Joined: Sat Dec 09, 2017 1:32 pm

AIME II 2018 problem 11

Unread post by samiul_samin » Wed Jan 30, 2019 5:21 pm

Find the number of permutations of $1, 2, 3, 4, 5, 6$ such that for each $k$ with $1$ $\leq$ $k$ $\leq$ $5$, at least one of the first $k$ terms of the permutation is greater than $k$.

Post Reply