Unverified50% confidenceFactExact time
In the optimal packing solution for n=11, some of the small squares must be rotated by approximately arctan(1/3) ≈ 18.43° to achieve the most compact arrangement.
1
Sources
50%
Confidence
Long-term
Relevance
10/7/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe square packing problem studies how to place n unit squares inside the smallest possible larger square without overlapping.68% similarUnverified黑塞配置不能在实平面上实现，因为椭圆曲线在实平面上至多有3个实拐点，而在复平面上恰好有9个63% similarUnverified球面亏格为0，环面亏格为1，亏格是衡量曲面复杂程度的拓扑不变量60% similarUnverified难抵极点从数学本质上等价于求解区域内切圆的圆心，在计算几何中被称为Chebyshev中心问题58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/984793API
curl https://kongchang.com/api/v1/knowledge/claims/984793MCP
get_claim(id=984793)