On the regular polygons

Abstract

Authors

Keywords

?

Paper coordinates

T. Popoviciu, Asupra poligoanelor regulate, Pozitiva, 2 (1941), pp. 92-97 (in Romanian).

PDF

About this paper

Journal
Publisher Name
DOI
Print ISSN
Online ISSN

[MR0017921]

google scholar link

??

Paper (preprint) in HTML form

1941 -Popoviciu- Pozitiva - On regular polygons html,body { width: 100%; height: 100%; } *, *::before,*::after { box-sizing: border-box; } body { margin: 0; color: #1E2029; font-size: 14px; line-height: normal; } hr { box-sizing: content-box; height: 0; overflow: visible; } h1, h2, h3, h4, h5, h6 { margin-top: 0; margin-bottom: 0.5em; color: rgba(0, 0, 0, 0.85); font-weight: 500; } p { margin-top: 0; margin-bottom: 1em; } ol, ul, dl { margin-top: 0; margin-bottom: 1em; } ol ol, ul ul, ol ul, ul ol { margin-bottom: 0; } dt { font-weight: 500; } dd { margin-bottom: 0.5em; margin-left: 0; } blockquote { margin: 0 0 1em; } dfn { font-style: italic; } b, strong { font-weight: bolder; } small { font-size: 80%; } sub, sup { position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } sub { bottom: -0.25em; } sup { top: -0.5em; } a { color: #0B93ff; text-decoration: none; background-color: transparent; outline: none; cursor: pointer; transition: color 0.3s; } a:hover { color: #33aaff; } a:active { color: #0070d9; } a:active, a:hover { text-decoration: none; outline: 0; } a[disabled] { color: rgba(0, 0, 0, 0.25); cursor: not-allowed; pointer-events: none; } pre, code, kbd, samp { font-size: 1em; } pre { margin-top: 0; margin-bottom: 1em; overflow: auto; } figure { margin: 0 0 1em; } img { vertical-align: middle; border-style: none; } svg:not(:root) { overflow: hidden; } table { border-collapse: collapse; } caption { padding-top: 0.75em; padding-bottom: 0.3em; color: rgba(0, 0, 0, 0.45); text-align: left; caption-side: bottom; } th { text-align: inherit; } mjx-container[jax="SVG"] { direction: ltr; } mjx-container[jax="SVG"] > svg { overflow: visible; min-height: 1px; min-width: 1px; } mjx-container[jax="SVG"] > svg a { fill: blue; stroke: blue; } mjx-assistive-mml { position: absolute !important; top: 0px; left: 0px; clip: rect(1px, 1px, 1px, 1px); padding: 1px 0px 0px 0px !important; border: 0px !important; display: block !important; width: auto !important; overflow: hidden !important; -webkit-touch-callout: none; -webkit-user-select: none; -khtml-user-select: none; -moz-user-select: none; -ms-user-select: none; user-select: none; } mjx-assistive-mml[display="block"] { width: 100% !important; } mjx-container[jax="SVG"][display="true"] { display: block; text-align: center; margin: 1em 0; } mjx-container[jax="SVG"][display="true"][width="full"] { display: flex; } mjx-container[jax="SVG"][justify="left"] { text-align: left; } mjx-container[jax="SVG"][justify="right"] { text-align: right; } g[data-mml-node="merror"] > g { fill: red; stroke: red; } g[data-mml-node="merror"] > rect[data-background] { fill: yellow; stroke: none; } g[data-mml-node="mtable"] > line[data-line], svg[data-table] > g > line[data-line] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > rect[data-frame], svg[data-table] > g > rect[data-frame] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > .mjx-dashed, svg[data-table] > g > .mjx-dashed { stroke-dasharray: 140; } g[data-mml-node="mtable"] > .mjx-dotted, svg[data-table] > g > .mjx-dotted { stroke-linecap: round; stroke-dasharray: 0,140; } g[data-mml-node="mtable"] > g > svg { overflow: visible; } [jax="SVG"] mjx-tool { display: inline-block; position: relative; width: 0; height: 0; } [jax="SVG"] mjx-tool > mjx-tip { position: absolute; top: 0; left: 0; } mjx-tool > mjx-tip { display: inline-block; padding: .2em; border: 1px solid #888; font-size: 70%; background-color: #F8F8F8; color: black; box-shadow: 2px 2px 5px #AAAAAA; } g[data-mml-node="maction"][data-toggle] { cursor: pointer; } mjx-status { display: block; position: fixed; left: 1em; bottom: 1em; min-width: 25%; padding: .2em .4em; border: 1px solid #888; font-size: 90%; background-color: #F8F8F8; color: black; } foreignObject[data-mjx-xml] { font-family: initial; line-height: normal; overflow: visible; } mjx-container[jax="SVG"] path[data-c], mjx-container[jax="SVG"] use[data-c] { stroke-width: 3; } #setText > div { justify-content: inherit; margin-top: 0; margin-bottom: 1em; } #setText div:last-child { margin-bottom: 0 !important; } #setText > br, #preview-content br { line-height: 1.2; } #preview-content > div { margin-top: 0; margin-bottom: 1em; } .proof > div, .theorem > div { margin-top: 1rem; } #preview-content table { margin-bottom: 1em; } #setText table { margin-bottom: 1em; } #preview-content .sub-table table, #setText .sub-table table { margin-bottom: 0; } mjx-container { text-indent: 0; overflow-y: hidden; overflow-x: auto; padding-top: 1px; padding-bottom: 1px; } .math-inline mjx-container { display: inline-block !important; page-break-inside: avoid; max-width: 100%; padding: 0; line-height: 0; } .math-inline[data-overflow="visible"] mjx-container { overflow: visible; } .math-inline mjx-container mjx-assistive-mml { max-width: 100%; } .math-block { align-items: center; page-break-after: auto; page-break-inside: avoid; margin: 0; display: block; /* mjx-container has block */ } .math-inline { display: inline-flex; /* mjx-container has inline-block. To prevent displacement during use overflow-x: auto;*/ max-width: 100%; } .math-block[data-width="full"] { overflow-x: auto; display: flex; /* mjx-container has flex */ } svg .math-inline { display: initial; max-width: initial; } svg .math-inline mjx-container { max-width: initial; } svg mjx-container { overflow: visible; padding: 0; } svg math-block[data-width="full"] { overflow: visible; } .math-block,.math-inline { --mmd-highlight-color: rgba(0, 147, 255, 0.25); --mmd-highlight-text-color: #1e2029; } .math-block[data-highlight-color] mjx-container[jax="SVG"] > svg { background-color: var(--mmd-highlight-color); } .math-block[data-highlight-text-color] mjx-container[jax="SVG"] > svg { color: var(--mmd-highlight-text-color); } .math-inline[data-highlight-color] mjx-container[jax="SVG"] { background-color: var(--mmd-highlight-color); } .math-inline[data-highlight-text-color] mjx-container[jax="SVG"] { color: var(--mmd-highlight-text-color); } .math-block p { flex-shrink: 1; } .math-block mjx-container { margin: 0 !important; } .math-error { background-color: yellow; color: red; } #preview-content img, #setText img { max-width: 100%; } #preview-content blockquote, #setText blockquote { page-break-inside: avoid; color: #666; margin: 0 0 1em 0; padding-left: 3em; border-left: .5em solid #eee; } #preview-content pre, #setText pre { border: none; padding: 0; overflow: auto; font-size: 85%; line-height: 1.45; border-radius: 6px; box-sizing: border-box; background: #f8f8fa; } #preview-content pre code, #setText pre code{ padding: 1rem; display: block; overflow-x: auto; line-height: 24px; } .empty { text-align: center; font-size: 18px; padding: 50px 0 !important; } #setText table, #preview-content table { display: table; overflow: auto; max-width: 100%; border-collapse: collapse; page-break-inside: avoid; } #setText table th, #preview-content table th { text-align: center; font-weight: bold; } #setText table td, #preview-content table td, #setText table th, #preview-content table th { border: 1px solid #dfe2e5; padding: 6px 13px; } #setText table tr, #preview-content table tr { background-color: #fff; border-top: 1px solid #c6cbd1; } #setText table tr:nth-child(2n), #preview-content table tr:nth-child(2n) { background-color: #f6f8fa; } #preview-content .main-title, #setText .main-title { text-align: center; line-height: 1.2; margin: 0 auto 1em auto; } #preview-content .author, #setText .author { text-align: center; margin: 0 auto; display: flex; justify-content: center; flex-wrap: wrap; } #preview-content .author p, #setText .author p { min-width: 30%; max-width: 50%; padding: 0 7px; } #preview-content .author > p > span, #setText .author > p > span { display: block; text-align: center; } #preview-content .section-title, #setText .section-title { margin-top: 1.5em; } #preview-content .abstract, #setText .abstract { text-align: justify; margin-bottom: 1em; } #preview-content .abstract p, #setText .abstract p { margin-bottom: 0; } @media print { #preview { font-size: 10pt!important; } svg { shape-rendering: crispEdges; } .math-block svg, math-inline svg { margin-top: 1px; } #preview-content img, #setText img { display: block; } #preview-content .figure_img img, #setText .figure_img img { display: inline; } .preview-right { word-break: break-word; } #preview-content h1, #setText h1 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h1::after, #setText h1::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h2, #setText h2 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h2::after, #setText h2::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h3, #setText h3 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h3::after, #setText h3::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h4, #setText h4 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h4::after, #setText h4::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h5, #setText h5 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h5::after, #setText h5::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h6, #setText h6 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h6::after, #setText h6::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } } #preview-content sup, #setText sup { top: -.5em; position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } #preview-content .text-url, #setText .text-url { color: #0B93ff; cursor: text; pointer-events: none; } #preview-content .text-url a:hover, #setText .text-url a:hover { color: #0B93ff; } mark { background-color: #feffe6; } span[data-underline-type] mark { background: inherit; background-color: #feffe6; padding-top: 0; padding-bottom: 0; } *[data-has-dotfill] { position: relative; overflow: hidden; } *[data-has-dotfill] .dotfill::after { position: absolute; padding-left: .25ch; content: " . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . "; text-align: right; } .smiles { text-align: center; } div.svg-container, #setText > div.svg-container { display: flex; justify-content: center; } #preview-content code, #setText code { font-family: Inconsolata; font-size: inherit; display: initial; background: #f8f8fa; } #preview-content .mmd-highlight code, #setText .mmd-highlight code, #preview-content pre.mmd-highlight code, #setText pre.mmd-highlight code { background-color: transparent; } #preview-content pre code, #setText pre code { font-family: 'DM Mono', Inconsolata, monospace; color: #333; font-size: 15px; } .hljs-comment, .hljs-quote { color: #998; font-style: italic; } .hljs-command { color: #005cc5; } .hljs-keyword, .hljs-selector-tag, .hljs-subst { color: #d73a49; font-weight: bold; } .hljs-number, .hljs-literal, .hljs-variable, .hljs-template-variable, .hljs-tag .hljs-attr { color: #005cc5; } .hljs-string, .hljs-doctag { color: #24292e; } .hljs-title, .hljs-section, .hljs-selector-id { color: #6f42c1; font-weight: bold; } .hljs-subst { font-weight: normal; } .hljs-type, .hljs-class .hljs-title { color: #458; font-weight: bold; } .hljs-tag, .hljs-name, .hljs-attribute { color: #000080; font-weight: normal; } .hljs-regexp, .hljs-link { color: #009926; } .hljs-symbol, .hljs-bullet { color: #990073; } .hljs-built_in, .hljs-builtin-name { color: #24292e; } .hljs-meta { color: #999; font-weight: bold; } .hljs-meta-keyword { color: #d73a49; } .hljs-meta-string { color: #032f62; } .hljs-deletion { background: #fdd; } .hljs-addition { background: #dfd; } .hljs-emphasis { font-style: italic; } .hljs-strong { font-weight: bold; } .table_tabular table th, .table_tabular table th { border: none !important; padding: 6px 13px; } .tabular tr, .tabular tr { border-top: none !important; border-bottom: none !important; } .tabular td, .tabular td { border-style: none !important; background-color: #fff; border-color: #000 !important; word-break: keep-all; padding: 0.1em 0.5em !important; } .tabular { display: inline-table !important; height: fit-content; } .tabular td > p { margin-bottom: 0; margin-top: 0; } .tabular td._empty { height: 1.3em; } .tabular td .f { opacity: 0; } html[data-theme="dark"] .tabular tr, html[data-theme="dark"] .tabular td { background-color: #202226; border-color: #fff !important; } .table_tabular { overflow-x: auto; padding: 0 2px 0.5em 2px; } .figure_img { margin-bottom: 0.5em; overflow-x: auto; } ol.enumerate, ul.itemize { padding-inline-start: 40px; } /* It's commented because counter not supporting to change value ol.enumerate.lower-alpha { counter-reset: item ; list-style-type: none !important; } .enumerate.lower-alpha > li { position: relative; } .enumerate.lower-alpha > li:before { content: "("counter(item, lower-alpha)")"; counter-increment: item; position: absolute; left: -47px; width: 47px; display: flex; justify-content: flex-end; padding-right: 7px; flex-wrap: nowrap; word-break: keep-all; } */ .itemize > li { position: relative; } .itemize > li > span.li_level, .li_enumerate.not_number > span.li_level { position: absolute; right: 100%; white-space: nowrap; width: max-content;; display: flex; justify-content: flex-end; padding-right: 10px; box-sizing: border-box; } .li_enumerate.not_number { position: relative; display: inline-block; list-style-type: none; } #preview { font-family: 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; font-size: 17px; visibility: visible; word-break: break-word; padding: 2.5em; max-width: 800px; margin: auto; box-sizing: content-box; } #preview h1, #preview h2, #preview h3, #preview h4, #preview h5, #preview strong { font-family: 'CMU Serif Bold', 'Georgia', Helvetica, Arial, sans-serif; } #preview i, #preview em { font-family: 'CMU Serif Italic', 'Georgia', Helvetica, Arial, sans-serif; } .mmd-menu { max-width: 320px; position: absolute; background-color: white; color: black; width: auto; padding: 5px 0px; border: 1px solid #E5E6EB; margin: 0; cursor: default; font: menu; text-align: left; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; z-index: 201; border-radius: 5px; -webkit-border-radius: 5px; -moz-border-radius: 5px; -khtml-border-radius: 5px; box-shadow: 0px 10px 20px #808080; -webkit-box-shadow: 0px 10px 20px #808080; -moz-box-shadow: 0px 10px 20px #808080; -khtml-box-shadow: 0px 10px 20px #808080; } .mmd-menu:focus { outline: none; } .mmd-menu.mmd-menu-sm { max-width: 100vw; padding-bottom: 34px; border-radius: 0; -webkit-border-radius: 0; -moz-border-radius: 0; -khtml-border-radius: 0; } .mmd-menu-item-icon { color: #1e2029; margin-left: auto; align-items: center; display: flex; flex-shrink: 0; display: none; } .mmd-menu-item { padding-bottom: 8px; padding-top: 8px; padding-left: 1.25rem; padding-right: 1.25rem; display: flex; background: transparent; height: 52px; max-height: 52px; } .mmd-menu-item:focus { outline: none; } .mmd-menu-item.active { background-color: #e1e0e5; } .mmd-menu-item.active .mmd-menu-item-icon { display: flex; } .mmd-menu-item-container { overflow: hidden; } .mmd-menu-item-title { color: #1e2029; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 14px; line-height: 20px; } .mmd-menu-item-value { color: #7d829c; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 12px; line-height: 16px; } html[data-theme="dark"] .mmd-menu-item-title { color: #ebefe7; } html[data-theme="dark"] .mmd-menu-item.active .mmd-menu-item-title { color: #1e2029; } html[data-theme="dark"] .mmd-menu { background-color: #33363a; } .mmd-context-menu-overlay{ background: rgba(0, 0, 0, 0.56); } .ClipboardButton { padding: 0; margin: 0.5rem; display: inline-block; cursor: pointer; color: rgb(36, 41, 47); background: rgb(246, 248, 250); border-radius: 6px; border: 1px solid rgba(31, 35, 40, 0.15); box-shadow: rgba(31, 35, 40, 0.04) 0 1px 0 0, rgba(255, 255, 255, 0.25) 0 1px 0 0 inset; position: relative; } .ClipboardButton:hover { background-color: rgb(243, 244, 246); border-color: rgba(31, 35, 40, 0.15); transition-duration: .1s; } .mmd-clipboard-icon { fill: currentColor; vertical-align: text-bottom; } .mmd-clipboard-copy-icon { color: rgb(101, 109, 118); } .mmd-clipboard-check-icon { color: rgb(26, 127, 55); } .mmd-tooltipped-no-delay:hover::before, .mmd-tooltipped-no-delay:hover::after { animation-delay: 0s; } .mmd-tooltipped:hover::before, .mmd-tooltipped:hover::after { display: inline-block; text-decoration: none; animation-name: tooltip-appear; animation-duration: .1s; animation-fill-mode: forwards; animation-timing-function: ease-in; animation-delay: .4s; } .mmd-tooltipped-w::before { top: 50%; bottom: 50%; left: -7px; margin-top: -6px; border-left-color: rgb(36, 41, 47); } .mmd-tooltipped::before { position: absolute; z-index: 1000001; display: none; width: 0; height: 0; color: rgb(36, 41, 47); pointer-events: none; content: ""; border: 6px solid transparent; opacity: 0; } .mmd-tooltipped-w::after { right: 100%; bottom: 50%; margin-right: 6px; transform: translateY(50%); } .mmd-tooltipped::after { position: absolute; z-index: 1000000; display: none; padding: 0.5em 0.75em; font: normal normal 11px/1.5 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; -webkit-font-smoothing: subpixel-antialiased; color: rgb(255, 255, 255); text-align: center; text-decoration: none; text-shadow: none; text-transform: none; letter-spacing: normal; word-wrap: break-word; white-space: pre; pointer-events: none; content: attr(aria-label); background: rgb(36, 41, 47); border-radius: 6px; opacity: 0; }
Original text
Rate this translation
Your feedback will be used to help improve Google Translate

On regular polygons

by Tiberiu Popoviciu

  1. Let's consider a regular polygon A 0 A 1 … A n − 1 A 0 A 1 … A n − 1 A_(0)A_(1)dotsA_(n-1)\mathrm{A}_{0} \mathrm{~A}_{1} \ldots \mathrm{~A}_{n-1}A0 A1… An−1of n n nnnsides in a plane. Let P be a point in the plane and
M 1 ( P ) = PA 0 ― + PA 1 ― + ⋯ + PA n − 1 n , M 2 ( P ) = PA ― 0 2 + P A 1 ― + ⋯ + PA n − 1 2 n . M 1 ( P ) = PA 0 ¯ + PA 1 ¯ + ⋯ + PA n − 1 n , M 2 ( P ) = PA ¯ 0 2 + P A 1 ¯ + ⋯ + PA n − 1 2 n . {:[M_(1)(P)=( bar(PA_(0))+ bar(PA_(1))+cdots+PA_(n-1))/(n)","],[M_(2)(P)=sqrt(( bar(PA)_(0)^(2)+ bar(PA_(1))+cdots+PA_(n-1)^(2))/(n)).]:}\begin{gathered} \mathrm{M}_{1}(\mathrm{P})=\frac{\overline{\mathrm{PA}_{0}}+\overline{\mathrm{PA}_{1}}+\cdots+\mathrm{PA}_{n-1}}{n}, \\ \mathrm{M}_{2}(\mathrm{P})=\sqrt{\frac{\overline{\mathrm{PA}}_{0}^{2}+\overline{\mathrm{P} A_{1}}+\cdots+\mathrm{PA}_{n-1}^{2}}{n}} . \end{gathered}M1(P)=PA0―+PA1―+⋯+PAn−1n,M2(P)=PA―02+PA1―+⋯+PAn−12n.
M 1 ( P ) M 1 ( P ) M_(1)(P)M_{1}(P)M1(P)is the arithmetic mean and M 2 ( P ) M 2 ( P ) M_(2)(P)M_{2}(P)M2(P)the square root of the distances of P from the vertices of the polygon. We always have the inequality
M 1 ( P ) ≦ M ? ( P ) M 1 ( P ) ≦ M ? ( P ) M_(1)(P) <= M_(?)(P)M_{1}(P) \leqq M_{?}(P)M1(P)≦M?(P)
and equality is only possible if PA ― = PA 1 ― = … = PA n − 1 ― PA ¯ = PA 1 ¯ = … = PA n − 1 ¯ bar(PA)= bar(PA_(1))=dots= bar(PA_(n-1))\overline{\mathrm{PA}}=\overline{\mathrm{PA}_{1}}=\ldots=\overline{\mathrm{PA}_{n-1}}PA―=PA1―=…=PAn−1―This actually happens if and only if P P PPPis the center of gravity of the polygon. In other words, the ratio
(1) E ( P ) = M 1 ( P ) M 1 ( P ) (1) E ( P ) = M 1 ( P ) M 1 ( P ) {:(1)E(P)=(M_(1)(P))/(M_(1)(P)):}\begin{equation*} E(P)=\frac{M_{1}(P)}{M_{1}(P)} \tag{1} \end{equation*}(1)AND(P)=M1(P)M1(P)
has a maximum equal to 1 and this maximum is reached if and only if P is the center of the polygon.
In the following we propose to determine the minimum of the ratio (1). It is sufficient to assume that the center of the polygon is the origin and that the vertices are represented by complex numbers e i 2 k π n , k = 0 , 1 , … n − 1 e i 2 k π n , k = 0 , 1 , … n − 1 e^(i(2k pi)/(n)),k=0,1,dots n-1e^{i \frac{2 k \pi}{n}}, k=0,1, \ldots n-1andi2kpn,k=0,1,…n−1. The floating point P P PPPwill be represented by the complex number ρ e i θ , ρ ρ e i θ , ρ rhoe^(i theta),rho\rho e^{i \theta}, \rhorandii,rbeing the module and θ θ theta\thetaithe argument, ρ ≧ 0 , 0 ≦ θ ≦ 2 π ρ ≧ 0 , 0 ≦ θ ≦ 2 π rho >= 0,0 <= theta <= 2pi\rho \geqq 0,0 \leqq \theta \leqq 2 \pir≧0,0≦i≦2p. We then have
PA k = ρ 2 + 1 − 2 ρ cos ⁡ ( θ − 2 k π n ) , k = 0 , 1 , … , n − 1 M 3 ( P ) = ρ 2 + 1 PA k = ρ 2 + 1 − 2 ρ cos ⁡ θ − 2 k π n , k = 0 , 1 , … , n − 1 M 3 ( P ) = ρ 2 + 1 {:[PA_(k)=sqrt(rho^(2)+1-2rho cos(theta-(2k pi)/(n)))","k=0","1","dots","n-1],[M_(3)(P)=sqrt(rho^(2)+1)]:}\begin{gathered} \mathrm{PA}_{k}=\sqrt{\rho^{2}+1-2 \rho \cos \left(\theta-\frac{2 k \pi}{n}\right)}, k=0,1, \ldots, n-1 \\ \mathrm{M}_{3}(\mathrm{P})=\sqrt{\rho^{2}+1} \end{gathered}PAk=r2+1−2rcos⁡(i−2kpn),k=0,1,…,n−1M3(P)=r2+1
  1. We can directly prove the following
Lemma. The ratio (1) has a positive minimum reached for at least one point P in the plane.
E ( P ) E ( P ) E(P)\mathrm{E}(\mathrm{P})AND(P)is a continuous function in the entire plane and never vanishes. Based on the above observations, if P 1 P 1 P_(1)P_{1}P1is a different point of origin,
so we have
0 < E ( P 1 ) = 0 < 1 0 < E P 1 = 0 < 1 0 < E(P_(1))=0 < 10<E\left(P_{1}\right)=0<10<AND(P1)=0<1
(010) min E ( P ) ≦ a < 1 min E ( P ) ≦ a < 1 quad minE(P) <= a < 1\quad \min \mathrm{E}(\mathrm{P}) \leqq a<1minAND(P)≦a<1.
Dar PA k ― ≧ | ρ − 1 | , M 2 ( P ) ≦ ρ + 1 Dar PA k ¯ ≧ | ρ − 1 | , M 2 ( P ) ≦ ρ + 1 Dar bar(PA_(k)) >= |rho-1|,M_(2)(P) <= rho+1\operatorname{Dar} \overline{\mathrm{PA}_{k}} \geqq|\rho-1|, \mathrm{M}_{2}(\mathrm{P}) \leqq \rho+1ButPAk―≧|r−1|,M2(P)≦r+1, so
E ( P ) ≧ | p − 1 | p + 1 E ( P ) ≧ | p − 1 | p + 1 E(P) >= (|p-1|)/(p+1)\mathrm{E}(\mathrm{P}) \geqq \frac{|p-1|}{p+1}AND(P)≧|p−1|p+1
If we take ρ > 1 + α 1 − α ρ > 1 + α 1 − α rho > (1+alpha)/(1-alpha)\rho>\frac{1+\alpha}{1-\alpha}r>1+a1−a, we have
E ( P ) > α . E ( P ) > α . E(P) > alpha.E(P)>\alpha .AND(P)>a.
It follows that the minimum of E ( P ) E ( P ) E(P)E(P)AND(P)in the whole plan it is the same c u c u cuc ucinhis minimum E ( P ) E ( P ) E(P)\mathrm{E}(\mathrm{P})AND(P)in the circle with center at the origin and radius 1 + α 1 − α 1 + α 1 − α (1+alpha)/(1-alpha)\frac{1+\alpha}{1-\alpha}1+a1−aThis latter circle is a closed and bounded domain so, according to a theorem of Weierstruss, its minimum E ( P ) E ( P ) E(P)\mathrm{E}(\mathrm{P})AND(P)is reached. This minimum cannot be zero because E ( P ) E ( P ) E(P)\mathrm{E}(\mathrm{P})AND(P)does not cancel, so
min E ( P ) > 0 . min E ( P ) > 0 . min E(P) > 0.\min E(P)>0 .minAND(P)>0.
We can also observe that, due to symmetry, the minimum is reached in at least n n nnnpoints forming a regular polygon with the center at the origin.
3. Let's now move on to the actual determination of the minimum.
Suppose that P moves on a half-line starting from the origin, in other words that θ θ theta\thetaiis fixed and ρ ρ rho\rhorvaries from 0 to + ∞ + ∞ +oo+\infty+∞Let's put
t = 2 p p 2 + 1 t = 2 p p 2 + 1 t=(2p)/(p^(2)+1)t=\frac{2 p}{p^{2}+1}t=2pp2+1
If ρ ρ rho\rhorvaries from 0 to + ∞ + ∞ +oo+\infty+∞, t t tttfirst increases from 0 to its maximum of 1 which it reaches for ρ = 1 ρ = 1 rho=1\rho=1r=1, and then decreases towards 0. We have
(2) E ( P ) = 1 n ∑ k = 1 n − 1 1 − t cos ⁡ ( θ − 2 k π n ) (2) E ( P ) = 1 n ∑ k = 1 n − 1 &hairsp; 1 − t cos ⁡ θ − 2 k π n {:(2)E(P)=(1)/(n)sum_(k=1)^(n-1)sqrt(1-t cos(theta-(2k pi)/(n))):}\begin{equation*} \mathrm{E}(\mathrm{P})=\frac{1}{n} \sum_{k=1}^{n-1} \sqrt{1-t \cos \left(\theta-\frac{2 k \pi}{n}\right)} \tag{2} \end{equation*}(2)AND(P)=1n∑k=1n−11−tcos⁡(i−2kpn)
E(P) is then a continuous function of t t tttin the closed range [ 0 , 1 ] [ 0 , 1 ] [0,1][0,1][0,1]and is indefinitely differentiable in the semiclosed interval [ 0 , 1 ) [ 0 , 1 ) [0,1)[0,1)[0,1)We have
d 2 E ( P ) d t 2 = − 1 4 n ∑ k = 0 n − 1 cos 2 ⁡ ( θ − 2 k π n ) [ 1 − t cos ⁡ ( θ − 2 k π n ) ] 3 d 2 E ( P ) d t 2 = − 1 4 n ∑ k = 0 n − 1 &hairsp; cos 2 ⁡ θ − 2 k π n 1 − t cos ⁡ θ − 2 k π n 3 (d^(2)E(P))/(dt^(2))=-(1)/(4n)sum_(k=0)^(n-1)(cos^(2)(theta-(2k pi)/(n)))/([sqrt(1-t cos(theta-(2k pi)/(n)))]^(3))\frac{d^{2} \mathrm{E}(\mathrm{P})}{d t^{2}}=-\frac{1}{4 n} \sum_{k=0}^{n-1} \frac{\cos ^{2}\left(\theta-\frac{2 k \pi}{n}\right)}{\left[\sqrt{1-t \cos \left(\theta-\frac{2 k \pi}{n}\right)}\right]^{3}}d2AND(P)dt2=−14n∑k=0n−1cos2⁡(i−2kpn)[1−tcos⁡(i−2kpn)]3
so
d 2 E ( P ) d t 2 < 0 , in intervalul [ 0 , 1 ) d 2 E ( P ) d t 2 < 0 ,  in intervalul  [ 0 , 1 ) (d^(2)E(P))/(dt^(2)) < 0,quad" in intervalul "[0,1)\frac{d^{2} \mathrm{E}(\mathrm{P})}{d t^{2}}<0, \quad \text { in intervalul }[0,1)d2AND(P)dt2<0, in the interval [0,1)
It is then known that E ( P ) E ( P ) E(P)\mathrm{E}(\mathrm{P})AND(P)is a concave function of t t tttin the closed range [ 0 , 1 ] [ 0 , 1 ] [0,1][0,1][0,1]This function does not reduce to a constant, so its minimum can only be reached for the extremes of the interval, that is, for t = 0 t = 0 t=0t=0t=0or t = 1 t = 1 t=1t=1t=1For t = 0 t = 0 t=0t=0t=0HAVE E ( P ) = 1 E ( P ) = 1 E(P)=1\mathrm{E}(\mathrm{P})=1AND(P)=1so the minimum is only reached for t = 1 t = 1 t=1t=1t=1and then we have p = 1 p = 1 p=1p=1p=1.
The minimum of expression (1) can therefore only be reached on the circumscribed circle of the polygon. Let ρ = 1 ρ = 1 rho=1\rho=1r=1and let's vary per. θ θ theta\thetaiIt is sufficient to consider, due to symmetry, the case 0 ≦ θ ≦ 2 π n 0 ≦ θ ≦ 2 π n 0 <= theta <= (2pi)/(n)0 \leqq \theta \leqq \frac{2 \pi}{n}0≦i≦2pn. We then have
(3)
E ( P ) = 2 n ∑ k = 0 n − 1 | sin ⁡ ( θ 2 − k π n ) | = E ( P ) = 2 n ∑ k = 0 n − 1 &hairsp; sin ⁡ θ 2 − k π n = E(P)=(sqrt2)/(n)sum_(k=0)^(n-1)|sin((theta)/(2)-(k pi)/(n))|=\mathrm{E}(\mathrm{P})=\frac{\sqrt{2}}{n} \sum_{k=0}^{n-1}\left|\sin \left(\frac{\theta}{2}-\frac{k \pi}{n}\right)\right|=AND(P)=2n∑k=0n−1|sin⁡(i2−kpn)|=
2 n [ sin ⁡ θ 2 + ∑ k = 1 n sin ⁡ ( k π n − θ 2 ) ] 2 n sin ⁡ θ 2 + ∑ k = 1 n &hairsp; sin ⁡ k π n − θ 2 (sqrt2)/(n)[sin((theta)/(2))+sum_(k=1)^(n)sin((k pi)/(n)-(theta)/(2))]\frac{\sqrt{2}}{n}\left[\sin \frac{\theta}{2}+\sum_{k=1}^{n} \sin \left(\frac{k \pi}{n}-\frac{\theta}{2}\right)\right]2n[sin⁡i2+∑k=1nsin⁡(kpn−i2)]
However, we have
∑ k = 1 n − 1 sin ⁡ k π n = cotg π 2 n , ∑ k = 1 n − 1 cos ⁡ k π n = 0 ∑ k = 1 n − 1 &hairsp; sin ⁡ k π n = cotg π 2 n , ∑ k = 1 n − 1 &hairsp; cos ⁡ k π n = 0 sum_(k=1)^(n-1)sin((k pi)/(n))=cotg((pi)/(2n)),quadsum_(k=1)^(n-1)cos((k pi)/(n))=0\sum_{k=1}^{n-1} \sin \frac{k \pi}{n}=\operatorname{cotg} \frac{\pi}{2 n}, \quad \sum_{k=1}^{n-1} \cos \frac{k \pi}{n}=0∑k=1n−1sin⁡kpn=boxp2n,∑k=1n−1cos⁡kpn=0
so
E ( P ) = 2 n − [ sin ⁡ θ 2 + cotg π 2 n cos ⁡ θ 2 ] E ( P ) = 2 n − sin ⁡ θ 2 + cotg π 2 n cos ⁡ θ 2 E(P)=(sqrt2)/(n)-[sin((theta)/(2))+cotg((pi)/(2n))cos((theta)/(2))]\mathrm{E}(\mathrm{P})=\frac{\sqrt{2}}{n}-\left[\sin \frac{\theta}{2}+\operatorname{cotg} \frac{\pi}{2 n} \cos \frac{\theta}{2}\right]AND(P)=2n−[sin⁡i2+boxp2ncos⁡i2]
and
min E ( P ) = 2 n cotg π 2 n min E ( P ) = 2 n cotg π 2 n min E(P)=(sqrt2)/(n)cotg((pi)/(2n))\min E(P)=\frac{\sqrt{2}}{n} \operatorname{cotg} \frac{\pi}{2 n}minAND(P)=2nboxp2n
which is reached only for θ = 0 θ = 0 theta=0\theta=0i=0and θ = 2 n θ = 2 n theta=(2)/(n)\theta=\frac{2}{n}i=2nWe can thus
state the following property
Theorem 1. If A i A I … A n − 1 A i A I … A n − 1 A_(i)A_(I)dotsA_(n-1)\mathrm{A}_{\mathrm{i}} \mathrm{A}_{\mathrm{I}} \ldots \mathrm{A}_{n-1}AiAI…An−1is a regular polygon of n sides and P a point in the plane of the polygon, we have
M 1 ( P ) ≧ V ′ 2 n cotg π 2 n M 2 ( P ) M 1 ( P ) ≧ V ′ 2 n cotg π 2 n M 2 ( P ) M_(1)(P) >= (V^(')2)/(n)cotg((pi)/(2n)M_(2))(P)\mathrm{M}_{1}(\mathrm{P}) \geqq \frac{\mathrm{V}^{\prime} 2}{n} \operatorname{cotg} \frac{\pi}{2 n} \mathrm{M}_{2}(\mathrm{P})M1(P)≧In′2nboxp2nM2(P)
or
PA ― 0 + PA ― 1 + … + PA ― n − 1 ) 2 ≧ 2 cotg 2 π 2 n PA ― 0 2 + PA ― 1 2 + … + PA ― n − 1 ) PA ¯ 0 + PA ¯ 1 + … + PA ¯ n − 1 2 ≧ 2 cotg 2 π 2 n PA ¯ 0 2 + PA ¯ 1 2 + … + PA ¯ n − 1 {: bar(PA)_(0)+ bar(PA)_(1)+dots+ bar(PA)_(n-1))^(2) >= 2cotg^(2)(pi)/(2n) bar(PA)_(0)^(2)+ bar(PA)_(1)^(2)+dots+ bar(PA)_(n-1))\left.\left.\overline{\mathrm{PA}}_{0}+\overline{\mathrm{PA}}_{1}+\ldots+\overline{\mathrm{PA}}_{n-1}\right)^{2} \geqq 2 \operatorname{cotg}^{2} \frac{\pi}{2 n} \overline{\mathrm{PA}}_{0}{ }^{2}+\overline{\mathrm{PA}}_{1}{ }^{2}+\ldots+\overline{\mathrm{PA}}_{n-1}\right)PA―0+PA―1+…+PA―n−1)2≧2box2p2nPA―02+PA―12+…+PA―n−1)
the equality being true only if P coincides with one of the vertices of the polygon.
4. Some of the previous results can be easily generalized. Let us consider, instead of the arithmetic mean M 1 ( P ) M 1 ( P ) M_(1)(P)\mathrm{M}_{1}(\mathrm{P})M1(P), average power r r rrrof the distances of P to the vertices of the polygon, that is
M r ( P ) = [ PA 0 ― r + PA 1 r + … + PA ― n − r n ] 1 r . M r ( P ) = PA 0 ¯ r + PA 1 r + … + PA ¯ n − r n 1 r . M_(r)(P)=[( bar(PA_(0))^(r)+PA_(1)r+dots+ bar(PA)_(n-)r)/(n)](1)/(r).\mathrm{M}_{r}(\mathrm{P})=\left[\frac{{\overline{\mathrm{PA}_{0}}}^{r}+\mathrm{PA}_{1} r+\ldots+\overline{\mathrm{PA}}_{n-} r}{n}\right] \frac{1}{r} .Mr(P)=[PA0―r+PA1r+…+PA―n−rn]1r.
If 0 < r < 2 0 < r < 2 0 < r < 20<r<20<r<2we still have M r ( P ) ≦ M 2 ( P ) M r ( P ) ≦ M 2 ( P ) M_(r)(P) <= M_(2)(P)\mathrm{M}_{r}(\mathrm{P}) \leqq \mathrm{M}_{2}(\mathrm{P})Mr(P)≦M2(P)and if r > 2 r > 2 r > 2r>2r>2HAVE M r ( P ) ≧ M 2 ( P ) M r ( P ) ≧ M 2 ( P ) M_(r)(P) >= M_(2)(P)\mathrm{M}_{r}(\mathrm{P}) \geqq \mathrm{M}_{2}(\mathrm{P})Mr(P)≧M2(P), equality cannot occur, in both cases, unless P P PPPis the center of the polygon. Let
E r ( P ) = M r ( P ) M i ( P ) E r ( P ) = M r ( P ) M i ( P ) E_(r)(P)=(M_(r)(P))/(M_(i)(P))\mathrm{E}_{r}(\mathrm{P})=\frac{\mathrm{M}_{r}(\mathrm{P})}{\mathrm{M}_{i}(\mathrm{P})}ANDr(P)=Mr(P)Mi(P)
If 0 < r < 2 , E r ( P ) 0 < r < 2 , E r ( P ) 0 < r < 2,E_(r)(P)0<r<2, \mathrm{E}_{r}(\mathrm{P})0<r<2,ANDr(P)has reached a minimum, and if r > 2 r > 2 r > 2r>2r>2a maximum reached. In the present case, expression (2) becomes
and
E r r ( P ) = 1 n ∑ k = 0 n − 1 [ 1 − t cos ⁡ ( 0 − 2 k π n ) ] r 2 E r r ( P ) = 1 n ∑ k = 0 n − 1 &hairsp; 1 − t cos ⁡ 0 − 2 k π n r 2 E_(r)^(r)(P)=(1)/(n)sum_(k=0)^(n-1)[1-t cos(0-(2k pi)/(n))]^((r)/(2))\mathrm{E}_{r}^{r}(\mathrm{P})=\frac{1}{n} \sum_{k=0}^{n-1}\left[1-t \cos \left(0-\frac{2 k \pi}{n}\right)\right]^{\frac{r}{2}}ANDrr(P)=1n∑k=0n−1[1−tcos⁡(0−2kpn)]r2
d 2 E r r ( P ) d t 2 = r ( r − 2 ) 4 ∑ k = 0 n − 1 cos 2 ⁡ ( θ − 2 k π n ) [ 1 − t cos ⁡ ( θ − 2 k π n ) ] r 2 − 2 d 2 E r r ( P ) d t 2 = r ( r − 2 ) 4 ∑ k = 0 n − 1 &hairsp; cos 2 ⁡ θ − 2 k π n 1 − t cos ⁡ θ − 2 k π n r 2 − 2 (d^(2)E_(r)^(r)(P))/(dt^(2))=(r(r-2))/(4)sum_(k=0)^(n-1)cos^(2)(theta-(2k pi)/(n))[1-t cos(theta-(2k pi)/(n))]^((r)/(2)-2)\frac{d^{2} \mathrm{E}_{r}^{r}(\mathrm{P})}{d t^{2}}=\frac{r(r-2)}{4} \sum_{k=0}^{n-1} \cos ^{2}\left(\theta-\frac{2 k \pi}{n}\right)\left[1-t \cos \left(\theta-\frac{2 k \pi}{n}\right)\right]^{\frac{r}{2}-2}d2ANDrr(P)dt2=r(r−2)4∑k=0n−1cos2⁡(i−2kpn)[1−tcos⁡(i−2kpn)]r2−2
which is < 0 < 0 < 0<0<0 resp. > 0 > 0 > 0>0>0as 0 < r < 2 0 < r < 2 0 < r < 20<r<20<r<2resp. r > 2 r > 2 r > 2r>2r>2. It is deduced as above that the minimum or maximum of E r ( P ) E r ( P ) E_(r)(P)\mathrm{E}_{r}(\mathrm{P})ANDr(P)it can only be touched on the circle circumscribed around the polygon
Expression (3) now becomes
E r r ( P ) = ( 2 ) r n [ sin r ⁡ θ 2 + ∑ k = 1 n − 1 sin r ⁡ ( k π n − θ 2 ) ] E r r ( P ) = ( 2 ) r n sin r ⁡ θ 2 + ∑ k = 1 n − 1 &hairsp; sin r ⁡ k π n − θ 2 E_(r)^(r)(P)=((sqrt2)^(r))/(n)[sin^(r)((theta)/(2))+sum_(k=1)^(n-1)sin^(r)((k pi)/(n)-(theta)/(2))]\mathrm{E}_{r}^{r}(\mathrm{P})=\frac{(\sqrt{2})^{r}}{n}\left[\sin ^{r} \frac{\theta}{2}+\sum_{k=1}^{n-1} \sin ^{r}\left(\frac{k \pi}{n}-\frac{\theta}{2}\right)\right]ANDrr(P)=(2)rn[sinr⁡i2+∑k=1n−1sinr⁡(kpn−i2)]
This expression is a continuous function of θ θ theta\thetaiin the interval [ 0 , 2 π n ] 0 , 2 π n [0,(2pi)/(n)]\left[0, \frac{2 \pi}{n}\right][0,2pn]We have, in the open interval ( 0 , 2 π n ) 0 , 2 π n (0,(2pi)/(n))\left(0, \frac{2 \pi}{n}\right)(0,2pn)
d 2 E r r ( P ) d t 2 = − r ( 2 ) r n − 1 4 n ∑ k = 0 1 | sin r − 2 ⁡ ( k π n − θ 2 ) | [ 1 − r cos 2 ⁡ ( k π n − θ 2 ] d 2 E r r ( P ) d t 2 = − r ( 2 ) r n − 1 4 n ∑ k = 0 1 &hairsp; sin r − 2 ⁡ k π n − θ 2 1 − r cos 2 ⁡ k π n − θ 2 (d^(2)E_(r)^(r)(P))/(dt^(2))=-(r(sqrt2)^(rn-1))/(4n)sum_(k=0)^(1)|sin^(r-2)((k pi)/(n)-(theta)/(2))|[1-rcos^(2)((k pi)/(n)-(theta)/(2)]:}\frac{d^{2} \mathrm{E}_{r}^{r}(\mathrm{P})}{d t^{2}}=-\frac{r(\sqrt{2})^{r n-1}}{4 n} \sum_{k=0}^{1}\left|\sin ^{r-2}\left(\frac{k \pi}{n}-\frac{\theta}{2}\right)\right|\left[1-r \cos ^{2}\left(\frac{k \pi}{n}-\frac{\theta}{2}\right]\right.d2ANDrr(P)dt2=−r(2)rn−14n∑k=01|sinr−2⁡(kpn−i2)|[1−rcos2⁡(kpn−i2]
and it is seen that this derivative is always negative if r ≦ 1 r ≦ 1 r <= 1r \leqq 1r≦1. One can, however, state the following generalization of Theorem 1.
Theorem 2. If A 0 A 1 … A n − 1 A 0 A 1 … A n − 1 A_(0)A_(1)dotsA_(n-1)A_{0} A_{1} \ldots A_{n-1}A0A1…An−1is a regular polygon of n n nnnswill, r r rrra positive number ≦ 1 ≦ 1 <= 1\leqq 1≦1and P P PPPa point in the plane of the polygon, we have
M r ( P ) ≧ 2 n [ ∑ k = 1 n − 1 sin r ⁡ k π n ] r ¯ M 2 ( P ) M r ( P ) ≧ 2 n ∑ k = 1 n − 1 &hairsp; sin r ⁡ k π n r ¯ M 2 ( P ) M_(r)(P) >= (sqrt2)/(sqrtn)[sum_(k=1)^(n-1)sin^(r)((k pi)/(n))] bar(r)M_(2)(P)\mathrm{M}_{r}(\mathrm{P}) \geqq \frac{\sqrt{2}}{\sqrt{n}}\left[\sum_{k=1}^{n-1} \sin ^{r} \frac{k \pi}{\mathrm{n}}\right] \bar{r} \mathrm{M}_{2}(\mathrm{P})Mr(P)≧2n[∑k=1n−1sinr⁡kpn]r¯M2(P)
equality is not true unless P P PPPcoincides with one of the vertices of the polygon.
5. But r > 1 r > 1 r > 1r>1r>1the problem is more complicated. We will examine here only the case when r r rrris a positive and even integer, r = 2 m r = 2 m r=2mr=2 mr=2mIt all comes down to evaluating the amount.
S m = ∑ k = 0 n − 1 sin 2 m ⁡ [ k π n − θ 2 ] S m = ∑ k = 0 n − 1 &hairsp; sin 2 m ⁡ k π n − θ 2 S_(m)=sum_(k=0)^(n-1)sin^(2m)[(k pi)/(n)-(theta)/(2)]\mathrm{S}_{m}=\sum_{k=0}^{n-1} \sin ^{2 m}\left[\frac{k \pi}{n}-\frac{\theta}{2}\right]Sm=∑k=0n−1sin2m⁡[kpn−i2]
Let's remember the formula
sin 2 m ⁡ α = 1 2 2 m ( 2 m m ) + 2 ∑ s = 1 m ( − 1 ) s m m + s 2 m ) 2 2 m cos ⁡ 2 s α sin 2 m ⁡ α = 1 2 2 m ( 2 m m ) + 2 ∑ s = 1 m &hairsp; ( − 1 ) s m m + s 2 m 2 2 m cos ⁡ 2 s α sin^(2m)alpha=(1)/(2^(2m))((2m)/(m))+2sum_(s=1)^(m)((-1)^(s)_(m)_(m+s)^(2m)))/(2^(2m))cos 2s alpha\sin ^{2 m} \alpha=\frac{1}{2^{2 m}}\binom{2 m}{m}+2 \sum_{s=1}^{m} \frac{\left.(-1)^{s}{ }_{m}{ }_{m+s}^{2 m}\right)}{2^{2 m}} \cos 2 s \alphasin2m⁡a=122m(2mm)+2∑s=1m(−1)smm+s2m)22mcos⁡2sa
However, we have
∑ k = 0 n − 1 cos ⁡ 2 s [ k π n − θ 2 ] = { 0 , dacă s ≢ 0 ( mod n ) ∑ k = 0 n − 1 &hairsp; cos ⁡ 2 s k π n − θ 2 = 0 ,       dacă       s ≢ 0 ( mod n ) sum_(k=0)^(n-1)cos 2s[(k pi)/(n)-(theta)/(2)]={[0","," dacă ",s≢0](modn):}\sum_{k=0}^{n-1} \cos 2 s\left[\frac{k \pi}{n}-\frac{\theta}{2}\right]=\left\{\begin{array}{lll}0, & \text { dacă } & s \not \equiv 0\end{array}(\bmod \mathrm{n})\right.ă∑k=0n−1cos⁡2s[kpn−i2]={0, if s≢0(againstn)
so
S m = n 2 2 m ( 2 m m ) + 2 n ∑ j = 1 ( m n ) ( − 1 ) j n ( 2 m m + j n ) 2 2 m cos ⁡ j n θ S m = n 2 2 m ( 2 m m ) + 2 n ∑ j = 1 m n &hairsp; ( − 1 ) j n ( 2 m m + j n ) 2 2 m cos ⁡ j n θ S_(m)=(n)/(2^(2m))((2(m))/((m)))+2nsum_(j=1)^(((m)/(n)))((-1)^(jn)((2m)/(m+jn)))/(2^(2m))cos jn theta\mathrm{S}_{m}=\frac{\mathrm{n}}{2^{2 m}}\binom{2 \mathrm{~m}}{\mathrm{~m}}+2 n \sum_{j=1}^{\left(\frac{m}{n}\right)} \frac{(-1)^{j n}\binom{2 m}{m+j n}}{2^{2 m}} \cos j n \thetaSm=n22m(2 m m)+2n∑j=1(mn)(−1)jn(2mm+jn)22mcos⁡jni
[ λ λ lambda\lambdal] meaning the largest integer ≦ λ ≦ λ <= lambda\leqq \lambda≦lEspecially
if m < n m < n m < nm<nm<n, we have
S m = n 2 2 m ( 2 m m ) S m = n 2 2 m ( 2 m m ) S_(m)=(n)/(2^(2m))((2(m))/((m)))S_{m}=\frac{n}{2^{2 m}}\binom{2 \mathrm{~m}}{\mathrm{~m}}Sm=n22m(2 m m)
and the following can be stated
Theorem 3. If m is an integer ( > 1 > 1 > 1>1>1) and A 0 A 1 … A n − 1 A 0 A 1 … A n − 1 A_(0)A_(1)dotsA_(n-1)A_{0} A_{1} \ldots A_{n-1}A0A1…An−1a regular polygon of n ≥ m n ≥ m n >= mn \geq mn≥msides and P P PPPa point in the plane of the polygon, we have
M 2 m ( P ) ≦ 1 2 ( 2 m m ) 1 2 m M 2 ( P ) M 2 m ( P ) ≦ 1 2 ( 2 m m ) 1 2 m M 2 ( P ) M_(2m)(P) <= (1)/(sqrt2)((2m)/(m))^((1)/(2m))M_(2)(P)\mathrm{M}_{2 m}(\mathrm{P}) \leqq \frac{1}{\sqrt{2}}\binom{2 m}{m}^{\frac{1}{2 m}} \mathrm{M}_{2}(\mathrm{P})M2m(P)≦12(2mm)12mM2(P)
equality is not true unless P P PPPis on the circle circumscribed around the polygon.
If we have m > n m > n m > nm>nm>n, it can be seen from its structure S m S m S_(m)S_{m}Smthat the maximum is reached for θ = 0 θ = 0 theta=0\theta=0i=0and θ = 2 π n θ = 2 π n theta=(2pi)/(n)\theta=\frac{2 \pi}{n}i=2pnif n n nnnit is even for θ = π n θ = π n theta=(pi )/(n)\theta=\frac{\pi}{n}i=pnif n n nnnis odd, so
Theorem 4. If A 0 A 1 … A n − 1 A 0 A 1 … A n − 1 A_(0)A_(1)dotsA_(n-1)A_{0} A_{1} \ldots A_{n-1}A0A1…An−1is a regular polygon of n ( ≧ 3 ) n ( ≧ 3 ) n( >= 3)n(\geqq 3)n(≧3)sides and m m mmma positive integer >in, whatever the point P P PPPfrom the polygon plane we have
M 2 m ( P ) M 2 ( P ) ≦ 1 2 [ ( 2 m m ) + 2 ∑ j = 1 [ m n ] ( 2 m m + j n ) ] 1 2 m M 2 m ( P ) M 2 ( P ) ≦ 1 2 ( 2 m m ) + 2 ∑ j = 1 m n &hairsp; ( 2 m m + j n ) 1 2 m (M_(2m)(P))/(M_(2)(P)) <= (1)/(sqrt2)[((2m)/(m))+2sum_(j=1)^([(m)/(n)])((2m)/(m+jn))]^((1)/(2m))\frac{\mathrm{M}_{2 m}(\mathrm{P})}{\mathrm{M}_{2}(\mathrm{P})} \leqq \frac{1}{\sqrt{2}}\left[\binom{2 m}{m}+2 \sum_{j=1}^{\left[\frac{m}{n}\right]}\binom{2 m}{m+j n}\right]^{\frac{1}{2 m}}M2m(P)M2(P)≦12[(2mm)+2∑j=1[mn](2mm+jn)]12m
equality is not true unless
1 0 n 1 0 n 1^(0)n1^{0} n10nbeing even, P P PPPcoincides with one of the vertices of the polygon.
2 0 n 2 0 n 2^(0)n2^{0} n20nbeing odd, P P PPPcoincides with the middle of a circumscribed arc limited by two consecutive vertices of the polygon.
6. To conclude, I draw the readers' attention to the fact that several of the previous results would be interesting to complete. First of all, it should be seen, in the special case examined by us, what happens if r r rrris any positive number greater than 1. We should then examine the case when instead of a regular polygon we take an arbitrary polygon. It can easily be seen that in general (for an arbitrary polygon) the ratio
M p ( P ) M q ( P ) M p ( P ) M q ( P ) (M_(p)(P))/(M_(q)(P))\frac{\mathrm{M}_{p}(\mathrm{P})}{\mathrm{M}_{q}(\mathrm{P})}Mp(P)Mq(P)
where 0 < p < q 0 < p < q 0 < p < q0<p<q0<p<q, has a minimum reached. This minimum depends on the polygon considered and has a maximum when this polygon varies. It is very likely that this "maximum minimorum" is reached, in particular, for a regular polygon.
Bucharest, November 29, 1941.
1941

Related Posts