##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(n^r arrangements)
If you have n choices and pick r times with replacement, the count is n^r.
Each of the r positions has n independent choices.
Example: 4 colors, pick 5 times (colors can repeat). Arrangements = 4^5 = 1024.
This grows faster than P(n,r) when repetition is allowed.
