The New New-Nacci Method for Calculating the Roots of a Univariate Polynomial and Solution of Quintic Equation in Radicals

An arbitrary univariate polynomial of nth degree has n sequences. The sequences are systematized into classes. All the values of the first class sequence are obtained by Newton’s polynomial of nth degree. Furthermore, the values of all sequences for each class are calculated by Newton’s identities. In other words, the sequences are formed without calculation of polynomial roots. The New-nacci method is used for the calculation of the roots of an nth-degree univariate polynomial using radicals and limits of successive members of sequences. In such an approach as is presented in this paper, limit play a catalytic–theoretical role. Moreover, only four basic algebraic operations are sufficient to calculate real roots. Radicals are necessary for calculating conjugated complex roots. The partial limitations of the New-nacci method may appear from the decadal polynomial. In the case that an arbitrary univariate polynomial of nth degree (n ≥ 10) has five or more conjugated complex roots, the roots of the polynomial cannot be calculated due to Abel’s impossibility theorem. The second phase of the New-nacci method solves this problem as well. This paper is focused on solving the roots of the quintic equation. The method is verified by applying it to the quintic polynomial with all real roots and the Degen–Abel polynomial, dating from 1821.

A note on identities for elementary symmetric and power sum polynomials

We provide a lightweight algorithm to express each of the elementary symmetric polynomials as a linear combination of (products of) power sum symmetric polynomials and, also, the power sums purely in terms of the elementary symmetric polynomials. Our method does not use Newton’s identities, which give such relations only implicitly. Each identity in the sequence is generated through a single differentiation.

The Concepts of Pseudo Compound Poisson and Partition Representations in Discrete Probability

The mathematical/statistical concepts of pseudo compound Poisson and partition representations in discrete probability are reviewed and clarified. A combinatorial interpretation of the convolution of geometric distributions in terms of a variant of Newton’s identities is obtained. The practical use of the twofold convolution leads to an improved goodness-of-fit for a data set from automobile insurance that was up to now not fitted satisfactorily.

A NOTE ON BARKER POLYNOMIALS

We call the polynomial [Formula: see text] a Barker polynomial of degree n-1 if each aj ∈{-1, 1} and [Formula: see text] Properties of Barker polynomials were studied by Turyn and Storer thoroughly in the early sixties, and by Saffari in the late eighties. In the last few years P. Borwein and his collaborators revived interest in the study of Barker polynomials (Barker codes, Barker sequences). In this paper we give a new proof of the fact that there is no Barker polynomial of even degree greater than 12, and hence Barker sequences of odd length greater than 13 do not exist. This is intimately tied to irreducibility questions and proved as a consequence of the following new result. Theorem.Ifn ≔ 2m + 1 > 13and[Formula: see text]where eachbj ∈{-1, 0, 1}for even values of j, each bj is an integer divisible by 4 for odd values of j, then there is no polynomial[Formula: see text]such that[Formula: see text], where[Formula: see text]and[Formula: see text]denotes the collection of all polynomials of degree 2m with each of their coefficients in {-1, 1}. A clever usage of Newton's identities plays a central role in our elegant proof.