证明题Assume that a chocolate bar consists of n squares arrange

证明题
Assume that a chocolate bar consists of n squares arranged in a rectangular pattern.The bar can only be broken along vertical or horizontal lines separating the squares.(Think of a Hershey’s bar.)
Assuming that only one piece can be broken at a time,determine how many breaks you must make in order to break the bar into n squares.Use induction to prove your answer iscorrect.
（翻译）
假设我有一块长方形巧克力,它有N个小块组成.我每次只能横着（水平）,或者竖着（垂直）的去掰它.假设,一次只能掰一块下来,想要把它掰成N块,请问要多少掰次?并且用归纳法去证明它的正确.

N个正方形 !不是N个小块!
如果是N个正方形,用归纳法!那先从最简单的开始 2个正方形组成的长方形,这时候N=2,你掰一下就可以,掰的次数=N-1,假设现在是3个小正方形了,你掰2下就可以,还是N-1
假设现在是4块了...你掰3下.以此类推.归纳为想要掰成N块,要掰N-1块.
然后加大难度,不仅横着有4块,而且有2排,也就是长为4块,宽为2块的长方形,那门我先摆成2个单条4块的,然后每个单条需要再掰3下,这样总共7下!还是N-1...
归纳去吧.
其实画个图先,把图画多几个,就了解了...很简单的阿...这英语你都能看懂,最起码也高中以上了...这数学最多是个小学奥数..