Unverified50% confidenceFactExact time
The square packing problem studies how to place n unit squares inside the smallest possible larger square without overlapping.
1
Sources
50%
Confidence
Long-term
Relevance
10/7/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedIn 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.68% similarUnverified球面亏格为0，环面亏格为1，亏格是衡量曲面复杂程度的拓扑不变量68% similarUnverifiedBy inscribing a unit circle of radius 1 inside a square with side length 2, the probability of a randomly scattered point falling inside the circle equals the circle's area divided by the square's area, i.e., π/4, so multiplying the proportion of points inside the circle by 4 estimates π.66% similarUnverifiedSolving a homography matrix requires at least 4 pairs of non-collinear corresponding points, because each pair of points provides 2 equations and 8 unknowns require 8 equations.65% similarUnverifiedA graph with n vertices has 2^(n(n-1)/2) possible configurations64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/984791API
curl https://kongchang.com/api/v1/knowledge/claims/984791MCP
get_claim(id=984791)