Prompt: You want to cut a rectangular pan of brownies, made up of n square-shaped brownies, but you can only make horizontal or vertical cuts. Assuming you can only make one cut at a time, how many cuts will you need to split the pan into n individual brownies? Use strong induction to prove your answer.
I have no idea how to do this question but I assume it's using pigeonhole principle in the proof. Any help as to how I can solve this? I was thinking to start: The base case of 1 is either 1 slice horizontally or 1 slice vertically to get 2 brownies. Meaning your brownies created are determined by (number of cuts * 2). But I am not sure how to do a strong induction proof for this.