arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1710.11245math.COmath.GR
收藏

给定周长的多边形

Integer polygons of given perimeter

James East, Ron Niles

摘要:

Honsberger的一个经典结果指出,具有整数边和周长$n$的不全等三角形的数目是最接近$\frac{n^2}{48}$($n$偶数)或$\frac{(n+3)^2}{48}$($n$奇数)的整数。我们解决了类似的问题$m$ -双(对于任意但固定的$m\geq3$),多边形(任意边数)。我们还表明,后者的解决方案是渐近$\frac{2^{n-1}}n$,和前者(固定$m$)的$\frac{2^{m-1}-m}{2^mm!}n^{m-1}$。

英文摘要:

A classical result of Honsberger states that the number of incongruent triangles with integer sides and perimeter $n$ is the nearest integer to $\frac{n^2}{48}$ ($n$ even) or $\frac{(n+3)^2}{48}$ ($n$ odd). We solve the analogous problem for $m$-gons (for arbitrary but fixed $m\geq3$), and for polygons (with arbitrary number of sides). We also show that the solution to the latter is asymptotic to $\frac{2^{n-1}}n$, and the former (for fixed $m$) to $\frac{2^{m-1}-m}{2^mm!}n^{m-1}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑