Mini Non-distinct Partition Puzzles
I figured it would be fun to do the opposite of my last puzzle and instead require that no cages contain distinct numbers. This works rather nicely in these small cases. Obviously, we can't have any two-by-one cages anymore, as the Latin square condition would require the entries there to be distinct. Thus the minimum number of entries per cell has increased. These may be fairly easy due to their size, but hopefully that just makes it a friendly introduction to this new style of puzzle.
A solution and a PDF version of this puzzle can be found at links at the bottom of this page.