$n \geq 6$ and we have a chain generalizing (19):
$m_1 = \ldots = m_{n - 1} = 2m$, $m_ n = m$,
$a_{12} = \ldots = a_{(n - 2) (n - 1)} = 2w$, $a_{(n - 1) n} = 4w$, and for other $i < j$ we have $a_{ij} = 0$,
$w_1 = w$, $w_2 = \ldots = w_{n - 1} = 2w$, $w_ n = 4w$
with $w$ and $m$ arbitrary,
Post a comment
Your email address will not be published. Required fields are marked.
In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$
). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).
All contributions are licensed under the GNU Free Documentation License.
Comments (0)