[離散] 三維切割遞迴數列
Find the recurrence relation satisfied by Sn,where Sn is the number of regions
into which three-dimensional space is divded by n planes if every three of the
planes meet in one point, but no four of the planes go through th same point.
Ans:Sn=Sn-1+(n^2-n+2)/2
懇求詳解!!
感謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.38.6.103