ArticlePDF Available

# On the Elementary Symmetric Polynomials and the Zeros of Legendre Polynomials

Authors:

## Abstract

In this paper, we seek to present some new identities for the elementary symmetric polynomials and use these identities to construct new explicit formulas for the Legendre polynomials. First, we shed light on the variable nature of elementary symmetric polynomials in terms of repetition and additive inverse by listing the results related to these. Sequentially, we have proven an important formula for the Legendre polynomials, in which the exponent moves one walk instead of twice as known. The importance of this formula appears throughout presenting Vieta’s formula for the Legendre polynomials in terms of their zeros and the results mentioned therein. We provide new identities for the elementary symmetric polynomials of the zeros of the Legendre polynomials. Finally, we propose the relationship between elementary symmetric polynomials for the zeros of P n x and the zeros of P n − 1 x .
Research Article
On the Elementary Symmetric Polynomials and the Zeros of
Legendre Polynomials
Maryam Salem Alatawi
Department of Mathematics, Faculty of Science, University of Tabuk, Tabuk 71491, Saudi Arabia
Correspondence should be addressed to Maryam Salem Alatawi; msoalatawi@ut.edu.sa
Received 28 February 2022; Accepted 22 April 2022; Published 28 May 2022
License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is
properly cited.
In this paper, we seek to present some new identities for the elementary symmetric polynomials and use these identities to
construct new explicit formulas for the Legendre polynomials. First, we shed light on the variable nature of elementary symmetric
polynomials in terms of repetition and additive inverse by listing the results related to these. Sequentially, we have proven an
important formula for the Legendre polynomials, in which the exponent moves one walk instead of twice as known. e
importance of this formula appears throughout presenting Vieta’s formula for the Legendre polynomials in terms of their zeros
and the results mentioned therein. We provide new identities for the elementary symmetric polynomials of the zeros of the
Legendre polynomials. Finally, we propose the relationship between elementary symmetric polynomials for the zeros of Pn(x)and
the zeros of Pn1(x).
1. Introduction
In the last few decades, the importance of symmetric
polynomials has emerged in many branches of pure and
applied mathematics, such as representation theory ,
algebraic combinatorics , and numerical analysis [3–5].
e symmetric polynomials have several types, for instance,
monomial, complete, and the elementary, see [6–9] and
references therein. roughout the current paper, we will
focus on the elementary type. Let us ﬁrst recall the funda-
mental concepts and well-known results that we will use
subsequently, for further details see [6, 10] and references
therein.
For positive integer n, the elementary symmetric poly-
nomial (for short, ESP) of degree kdenoted by
e(n)
k(x1, x2,. . . , xn)is deﬁned as the sum of all possible
products of kvariables of x1, x2,. . . , xn; that is,
e(n)
kx1, x2,. . . , xn
 􏼁􏽘
11<2<···<kn􏽙
k
i1
xi,(1)
with e(n)
0(x1, x2,. . . , xn) � 1 and e(n)
k(x1, x2,. . . , xn) � 0 for
k>nor k<0. It is easy to see that e(n)
k(x1, x2,. . . , xn)in-
volves n
k
􏼠 􏼡terms. For example, the ESPs for n3 are given
by the following:
e(3)
0x1, x2, x3
 􏼁1,
e(3)
1x1, x2, x3
 􏼁x1+x2+x3,
e(3)
2x1, x2, x3
 􏼁x1x2+x1x3+x2x3,
e(3)
3x1, x2, x3
 􏼁x1x2x3.
(2)
e generating function of the ESP, e(n)
k(x), where x
denotes the ntuple of the variables (x1, x2,. . . , xn)is given
by the following:
􏽙
n
i1
1+xiλ
 􏼁􏽘
n
k0
e(n)
k(x)λk.(3)
Notice that, from the generation function (3), we have
the following recurrence relation:
Hindawi
Journal of Mathematics
Volume 2022, Article ID 4139728, 9 pages
https://doi.org/10.1155/2022/4139728
e(n)
k(x) � e(n1)
kx1, x2,. . . , xn1
 􏼁+xne(n1)
k1x1, x2,. . . , xn1
 􏼁,(4)
for all n1 and k1,2,..., n with e(n1)
0(·) � 1, see .
Moreover, we can deduce the following:
e(n)
k(− x) �(− 1)ke(n)
k(x).(5)
e orthogonal polynomials such as Hermite, Laguerre,
and Jacobi have great importance in applied sciences, for
instance, in quantum mechanics, engineering, and com-
putational mathematics (e.g., [11–15] and references
therein). e Legendre polynomials are a particular case of
the Jacobi polynomials that can be applied to reveal
Schoenberg’s representation of positive deﬁnite functions on
the unit sphere, see . Now, we shall go through some
known results of the Legendre polynomials that we ought to
use later on, see [16–24] for further details. e Legendre
polynomials Pn(x)
􏼈 􏼉
n0can be deﬁned as the coeﬃcients of
βnin the following generating function, that is,
1
����������
12xβ+β2
􏽱􏽘
n0Pn(x)βn,(6)
where β(− 1,1). Favard’s theorem (, eorem 4.5.1)
showed that the Legendre polynomials Pn(x)
􏼈 􏼉
n0satisﬁes
the following three-term recurrence relation:
Pn(x) � xPn1(x) + 11
n
􏼒 􏼓 xPn1(x) − Pn2(x)
􏼂 􏼃,(7)
for all n2,3,4,..., with P0(x) � 1 and P1(x) � x, see .
Also, the Legendre polynomials Pn(x)satisﬁes the following:
d
dxPn(x)
􏼂 􏼃nPn1(x) + xd
dxPn1(x)
􏼂 􏼃,(8)
for all n1,2,. . ., see . In addition to this, the Legendre
polynomials have many explicit formulas, for instance the
following representation:
Pn(x) � 2n􏽘
n/2
k0(− 1)kn
k
􏼠 􏼡 2n2k
n
􏼠 􏼡xn2k,(9)
where ⌊ · ⌋ denotes the ﬂoor function, see . e or-
thogonality property for a sequence of the Legendre poly-
nomials Pn(x)
􏼈 􏼉
n0on the closed interval [− 1,1]is given by
the following:
􏽚1
1
Pn(x)Pm(x)dx2
2n+1δnm,(10)
where δnm denotes the Kronecker delta which is equal to 1 if
nm, and 0 otherwise, see .
e current paper is organized as follows: In Section 2,
we introduce new identities for the elementary symmetric
polynomials. Section 3 is mainly devoted to the present new
formulas for the Legendre polynomials in terms of their
zeros. In Section 4, novel identities for the elementary
symmetric polynomials of the zeros of the Legendre poly-
nomials are presented. In Section 5, some illustrative ex-
amples are given.
2. New Identities for Elementary
Symmetric Polynomials
In this section, we are mainly concerned with introducing
the main results related to the ESPs that we will use
subsequently.
Lemma 1. For kZ+0
{ } and for any even positive integer
n, we have the following:
e(n)
kx1, x2,. . . , xn/2,x1,x2,. . . ,xn/2
 􏼁
0,if k0(mod2);
(− 1)k/2e(n/2)
k/2 x2
1, x2
2,. . . , x2
n/2
􏼐 􏼑,if k0(mod2).
(11)
Proof: Following the generating function (3), we have as
follows:
􏽘
n
k0
e(n)
kx1, x2,. . . , xn/2,x1,x2,. . . ,xn/2
 􏼁λk
􏽙
n/2
i1
1+xiλ
 􏼁􏽙
n/2
i1
1xiλ
 􏼁􏽙
n/2
i1
1x2
iλ2
􏼐 􏼑
􏽘
n/2
k0(− 1)ke(n/2)
kx2
1, x2
2,. . . , x2
n/2
􏼐 􏼑λ2k.
(12)
By comparing the coeﬃcients on both sides, we complete
the proof.
Moreover, we present the following result that studies
the ESPs for another special case of the variables
x1, x2,. . . , xn.
Lemma 2. For kZ+0
{ } and for any odd positive integer
n>1, we have
e(n)
kx1, x2,..., x(n1)/2,0,x1,x2,...,x(n1)/2
􏼐 􏼑
0,if k0(mod2);
(− 1)k/2e((n+1)/2)
k/2 0, x2
1, x2
2,..., x2
(n1)/2
􏼐 􏼑,if k0(mod2).
(13)
Proof: Following the generating function (3), we have as
follows:
􏽘
n
k0
e(n)
kx1, x2,. . . , x(n1)/2,0,x1,x2,. . . ,x(n1)/2
􏼐 􏼑λk
􏽙
(n1)/2
i1
1+xiλ
􏼁 1+x(n+1)/2λ
􏼐 􏼑|x(n+1)/20􏽙
(n1)/2
i1
1xiλ
 􏼁
􏽙
(n+1)/2
i1
1x2
iλ2
􏼐 􏼑|x(n+1)/20
􏽘
(n+1)/2
k0(− 1)ke(n+1)/2
k0, x2
1, x2
2,. . . , x2
(n1)/2
􏼐 􏼑λ2k.
(14)
2Journal of Mathematics
By comparing the coeﬃcients on both sides, we obtain
(13). is completes the proof.
e following results give a closed form of the ESPs for
non-distinct variables. Notice that since e(n)
k(·) � 0 for k>n,
then the generating function of the ESP (3) is equivalent to
the following:
􏽙
n
i1
1+xiλ
 􏼁􏽘
k0
e(n)
k(x)λk.(15)
Lemma 3. For kZ+0
{ } and na positive integer, we have
as follows:
e(2n)
kx1, x2,. . . , xn, x1, x2,. . . , xn
 􏼁
􏽘
k
i0
e(n)
ix1, x2,. . . , xn
 􏼁e(n)
kix1, x2,. . . , xn
 􏼁.(16)
Proof: Following the generating function (3), we have as
follows:
􏽘
2n
k0
e(2n)
kx1, x2,. . . , xn, x1, x2,. . . , xn
 􏼁λk
􏽙
n
i1
1+xiλ
 􏼁􏽙
n
i1
1+xiλ
 􏼁
􏽙
n
i1
1+xiλ
 􏼁
2
􏽘
n
k0
e(n)
kx1, x2,. . . , xn
 􏼁λk
2
.
(17)
By considering (15) and applying the Cauchy product
(, Deﬁnition 9.4.6.), we deduce the following:
􏽘
2n
k0
e(2n)
kx1, x2,. . . , xn, x1, x2,. . . , xn
 􏼁λk
􏽘
2n
k0􏽘
k
i0
e(n)
ix1, x2,. . . , xn
 􏼁e(n)
kix1, x2,. . . , xn
 􏼁
λk.
(18)
is completes the proof.
Now, we seek to generalize Lemma 3 in the following
result.
Theorem 1. For kZ+0
{ } and n, ℓ positive integers, we
have as follows:
e(n+)
kx1, x2,. . . , xn, y1, y2,. . . , y
 􏼁
􏽘
k
i0
e(n)
ix1, x2,. . . , xn
 􏼁e()
kiy1, y2,. . . , y
 􏼁.(19)
Proof: Following the generating function (3), we have as
follows:
􏽘
n+
k0
e(n+)
kx1, x2,. . . , xn, y1, y2,. . . , y
 􏼁λk
􏽙
n
i1
1+xiλ
 􏼁􏽙
i1
1+yiλ
 􏼁
􏽘
n
k0
e(n)
kx1, x2,. . . , xn
 􏼁λk
􏽘
k0
e()
iy1, y2,. . . , y
 􏼁λi
.
(20)
By considering (15) and applying the Cauchy product
(, Deﬁnition 9.4.6.), we deduce the following:
􏽘
n+
k0
e(n+)
kx1, x2,. . . , xn, y1, y2,. . . , y
 􏼁λk
􏽘
n+
k0􏽘
k
i0
e(n)
ix1, x2,. . . , xn
 􏼁e()
kiy1, y2,. . . , y
 􏼁
λk.
(21)
is completes the proof.
3. More Formulas for the Legendre Polynomials
roughout the current section, we will introduce some
results related to the Legendre polynomials. We start this
section by giving a simple proof for an equivalent explicit
formula for the Legendre polynomials.
Lemma 4. Consider Pn
􏼈 􏼉
n0to be a sequence of the Legendre
polynomials. en, the explicit formula (9) coincides with the
following formula:
Pn(x) � 2n􏽘
n
k0
n
k
n+k1
2
n
xk.(22)
Proof: Let an
k2nn
k
􏼠 􏼡 2n2k
n
􏼠 􏼡 and
bn
m2nn
m
􏼠 􏼡 (n+m1)/2
n
􏼠 􏼡. en, we have the
following:
bn
n2k+12nn
n2k+1
􏼠 􏼡 nk
n
􏼠 􏼡,(23)
since nk
n
􏼠 􏼡0 for all k1. Hence bn
n2k+10 for
k1,2,...,n/2 ⌋ − 1. Now, it is suﬃcient to show that
bn
n2kan
kfor all k0,1,. . . ,n/2 .
Journal of Mathematics 3
bn
n2k2nn
n2k
2n2k1
2
n
(2n2k1)(2n2k3)· ·· (− 2k+1)
(n2k)!(2k)!
(2n2k1)(2n2k3)· ·· 3·1
(n2k)!(− 1)(− 3)· ·· (− 2k1)(− 2k+1)
(2k)!
(2n2k)!
2nk(nk)!
1
(n2k)!(2k)!(− 1)k(2k)!
2kk!
2n(− 1)kn!
(nk)!k!(2n2k)!
n!(n2k)!
2nn
k
2n2k
n
an
k.
(24)
is fact completes the proof.
It is easy to see that, according to formula (22), the
Legendre polynomials take the following expression:
Pn(x) � αn,0+αn,1x+αn,2x2+ · ·· + αn,nxn,(25)
where
αn,k 2nn
k
n+k1
2
n
,(26)
for all k0,1,2,. . . , n.
Now, it is the time to give the following result which
reformulates the Legendre polynomial explicit formula
(22).
Lemma 5. Consider Pn
􏼈 􏼉
n0to be a sequence of the Legendre
polynomials. en, the explicit formula (22) is equivalent to
the following:
Pn(x) � 􏽘
n
k0
k0(mod2)
(− 1)k/2(2nk1)!!(k1)!!
k!(nk)!xnk,(27)
where (·)!! denotes the double factorial, with (− 1)!! 1and
(0)!! 0.
Proof: e coeﬃcient of xnkin equation (22) is given by the
following:
αn,nk2nn
nk
2nk1
2
n
(2nk1)(2nk3)· ·· (− k+1)
(nk)!k!.
(28)
Assume that 􏽢
αn,k � (2nk1)(2nk3)· ·· (− k+1),
then we have two cases to consider based on k:
(i) If k0(mod2), then 􏽢
αn,k will vanish since it contains
0 as a factor; hence, so the coeﬃcients in (27) equals
to zero.
(ii) If k0(mod2), then we have the following:
􏽢
αn,k (2nk1)· ··(3) · (1) · (− 1) · (− 3)·· ·(− k+1)
(2nk1)!!(− 1)k/2(k1)!!.
(29)
is fact completes the proof.
Notice that following Lemma 5, we conclude that n/2
coeﬃcients in (25) are equals to zero, where ⌈ · ⌉denotes the
ceiling function. Now, we state the following result, which
4Journal of Mathematics
constructs the Legendre polynomials in terms of their
zeros.
Theorem 2. For any positive integer n, consider
x1, x2,. . . , xnto be the zeros of Legendre polynomials Pn(x),
then
Pn(x) � 2n+12n1
n
􏼠 􏼡􏽘
n
k0(− 1)nke(n)
nkx1, x2,. . . , xn
 􏼁xk.
(30)
Proof: . e leading coeﬃcient αn,n in formula (25) is given
by the following:
αn,n 2n
2n1
2
n
2n((2n1)/2)((2n2)/2)((2n3)/2)((2n4)/2)·· · (2/2)(1/2)
n!(n1)!
2n+12n1
n
.
(31)
Now, we can rewrite formula (25) as follows:
Pn(x) � 2n+12n1
n
􏼠 􏼡q(x),(32)
where q(x)be a monic polynomial of degree n. Since
x1, x2,. . . , xnbe the zeros of the Legendre polynomial of
degree n, then the polynomial q(x)has ndistinct linear
factors. erefore, we can write the polynomial q(x)as
follows:
q(x) � 􏽙
n
i1
xxi
 􏼁.(33)
By applying Vieta’s theorem , we deduce the
following:
q(x) � 􏽘
n
k0(− 1)nke(n)
nk(x)xk,(34)
which completes the proof.
On the other hand, for any Legendre polynomial Pn(x),
there is a negative zero with the same absolute value for every
positive zero. So , it is clear that e(n)
1(x1, x2,. . . , xn) � 0 for
all n2.
4. On the Zeros of Legendre Polynomials
In this section, we present the results related to the zeros of
the Legendre polynomials. Based on Lemma 5 and eorem
2, we state the following result that gives a closed-form for
the ESPs of Legendre’s zeros.
Corollary 1. For any positive integers nand k. Consider
x1, x2,. . . , xnto be the zeros of the Legendre polynomial
Pn(x), then
e(n)
kx1, x2,. . . , xn
 􏼁
(− 1)3k/2 2n1n
k
(2nk1)!!(k1)!!(n1)!
(2n1)!,
(35)
with e(n)
0(x1, x2,. . . , xn) � 1.
e Legendre polynomial Pn(x)is an even function
when nis even; moreover, it has nzeros, half of the zeros are
negative and the other half is positive. On the contrary, when
nis odd, we ﬁnd that the polynomial is an odd function and
has zero at x0 and half of the remaining zeros are negative
and the other half positive. Based on the type of degree of the
polynomial being even or odd and applying Lemmas 1 and 2,
respectively, we conclude the following corollaries.
Corollary 2. For any positive even integer n. e Legendre
polynomial Pn(x)is given by the following:
Pn(x) � 2n+12n1
n
􏼠 􏼡 􏽘
n
k0
k0(mod2)
(− 1)3k/2e(n/2)
k/2 x2
1, x2
2,..., x2
n/2
􏼐 􏼑xnk,
(36)
for all positive zeros x1, x2,. . . , xn/2.
Corollary 3. For any positive odd integer n. e Legendre
polynomial Pn(x)is given by the following:
Pn(x) � 2n+12n1
n
􏼠 􏼡 􏽘
n
k0
k0(mod2)(− 1)3k/2e((n+1)/2)
k/2 0, x2
1, x2
2,. . . , x2
(n1)/2
􏼐 􏼑xnk,
(37)
for all positive zeros x1, x2,. . . , x(n1)/2.
It is clear that Corollaries 2 and 3 reduce the compu-
tational cost, since in the case of odd kthe coeﬃcient be-
comes zero.
Based on the orthogonality of the Legendre polynomials,
we provide the following result.
Lemma 6. For any positive integer n, we have the following:
􏽚1
1
Pn(x)
􏼂 􏼃2dx
2n+(3/2)2n1
n
2􏽘
2n
k0
k0(mod2)
(− 1)k/2e(n)
k/2 x2
1, x2
2,. . . , x2
n
􏼐 􏼑
2nk+1,
(38)
Journal of Mathematics 5
for all zeros x1, x2,. . . , xnof Pn(x).
Proof: Following eorem 2, we deduce the following:
Pn(x)
􏼂 􏼃2Υn􏽘
n
k0(− 1)ke(n)
kx1, x2,. . . , xn
 􏼁xnk
2
,(39)
where Υn2n+12n1
n
􏼠 􏼡􏼢 􏼣2
.
By considering (15) and applying the Cauchy product,
we deduce the following:
Pn(x)
􏼂 􏼃2Υn􏽘
2n
k0(− 1)k􏽘
k
i0
e(n)
ix1, x2,. . . , xn
 􏼁×e(n)
kix1, x2,. . . , xn
 􏼁
x2nk.(40)
By applying Lemma 3, we obtain the following:
Pn(x)
􏼂 􏼃2Υn􏽘
2n
k0(− 1)ke(2n)
kx1, x2,. . . , xn, x1, x2,. . . , xn
 􏼁x2nk.
(41)
By integrating both sides on the interval [− 1,1], we
conclude as follows:
􏽚1
1
Pn(x)
􏼂 􏼃2dxΥn􏽘
2n
k0
(− 1)k
2nk+1e(2n)
kx1, x2,. . . , xn, x1, x2,. . . , xn
 􏼁􏼢
+1
2nk+1e(2n)
kx1, x2,. . . , xn, x1, x2,. . . , xn
 􏼁􏼕.
(42)
erefore, by considering the nature of Legendre’s zeros,
we obtain (38) by expanding the previous summation on the
right-hand side and then applying Lemma 1. is completes
the proof.
Furthermore, we can deduce the following result.
Corollary 4. For any positive integer n. Consider the Leg-
endre polynomial Pn(x)with zeros x1, x2,. . . , xn, then
􏽘
2n
k0
k0(mod2)
(− 1)k/2e(n)
k/2 x2
1, x2
2,..., x2
n
􏼐 􏼑
2nk+12
2n+12n1n!(n1)!
(2n1)!
􏼢 􏼣2
.
(43)
Similarly, following the orthogonality of the Legendre
polynomials with distinct degrees, we deduce the following
result.
Corollary 5. Let n, m be positive integers with nm. Con-
sider the Legendre polynomial Pn(x)with zeros x1, x2,. . . , xn
arranged in ascending order, namely, x1<x2<... <xnand
similarly Pn(x)with zeros y1, y2,. . . , ymwith
y1<y2<·· · <ym, then
􏽘
n+m
k0
k0(mod2)
(− 1)k/2
n+mk+1e(⌈(n+m)/2⌉)
k/2 x2
1, x2
2,. . . , x2
n/2 , y2
1, y2
2,. . . , y2
m/2
􏼐 􏼑0.
(44)
e following result gives a relation between the ESPs for
the zeros of Legendre polynomials Pn(x)and Pn1(x).
Theorem 3. Let n be a positive integer. Consider the Leg-
endre polynomial Pn(x)with zeros x1, x2,. . . , xnand
Pn1(x)with zeros y1, y2,. . . , yn1, then
e(n)
kx1, x2,. . . , xn
 􏼁n(2nk1)
(2n1)(nk)e(n1)
ky1, y2,..., yn1
 􏼁,
(45)
for all k0,1,2,. . . , n 1.
Proof: Following the recurrence relation (8), we obtain the
following:
2n1
n􏽘
n1
k0(− 1)k(nk)e(n)
k(x)xnk1
n􏽘
n1
k0(− 1)ke(n1)
k(y)xnk1+􏽘
n2
k0(− 1)k(nk1)e(n1)
k(y)xnk1,
(46)
6Journal of Mathematics
where ydenotes the (n1)− tuple (y1, y2,. . . , yn1). Based
on the deﬁnition of ESPs, we can rewrite the last term in (46)
as follows:
􏽘
n2
k0(− 1)k(nk1)e(n1)
k(y)xnk1􏽘
n1
k0(− 1)k(nk1)e(n1)
k(y)xnk1.
(47)
erefore, by comparing the coeﬃcients of xnk1, we
obtain the following:
(2n1)(nk)
ne(n)
k(x) � ne(n1)
k(y) +(nk1)e(n1)
k(y),
(48)
which completes the proof.
Following eorem 3, it is easy to construct the Legendre
polynomial Pn(x)via the zeros of Pn1(x), looking forward
the following corollary.
Corollary 6. Let nbe a positive integer, with n>1. Assume
that the Legendre polynomial Pn1(x)has zeros
y1, y2,. . . , yn1, then
Pn(x) � 2n+1n
2n1
􏼒 􏼓 2n1
n
􏽘
n
k1(− 1)nkn+k1
k
􏼠 􏼡e(n1)
nky1, y2,. . . , yn1
 􏼁xk+2n
n1
2
n
.(49)
It is easy to see that if nis odd, then the last term of (49)
will vanish.
5. Numerical Examples
roughout this section, we shall give some examples to
illustrate the results are posted in Sections 3 and 4. Let us
eorem 2.
Example 1. e zeros of P3(x)are x1��
3/5
, x20 and
x3� − ��
3/5
, then following (2), we have the following:
e(3)
0x1, x2, x3
 􏼁1,
e(3)
1x1, x2, x3
 􏼁0,
e(3)
2x1, x2, x3
 􏼁� − 3
5,
e(3)
3x1, x2, x3
 􏼁0.
(50)
erefore, by applying eorem 2, then we obtain as
follows:
P3(x) � 225
3
e(3)
3x1, x2, x3
 􏼁+e(3)
2x1, x2, x3
 􏼁xe(3)
1x1, x2, x3
 􏼁x2+e(3)
0x1, x2, x3
 􏼁x3
􏽨 􏽩
1
4
􏼒 􏼓(10) 3
5x+x3
􏼔 􏼕.
(51)
Moreover, we deduce that P3(x) � (1/2)(5x33x).
e following example to illustrates the idea of Corol-
laries 2 and 3.
Example 2. e zeros of Legendre polynomial P4(x)are
x1�������������
(15 +2��
30
)/35
􏽰, x2�������������
(15 2��
30
)/35
􏽰, x3
�������������
(15 +2��
30
)/35
􏽰and x4� − �������������
(15 2��
30
)/35
􏽰, then fol-
lowing Corollary 2, we have the following:
P4(x) � 35
8Λ4,0x4+Λ4,2x2+Λ4,4
􏽨 􏽩,(52)
where Λ4,1Λ4,30. Moreover, we obtain as follows:
Λ4,0e(2)
0x2
1, x2
2
􏼐 􏼑1,
Λ4,2e(2)
1x2
1, x2
2
􏼐 􏼑� − 30
35,
Λ4,4e(2)
2x2
1, x2
2
􏼐 􏼑105
(35)2.
(53)
us, we conclude that P4(x) � (1/8)(35x430x2+3).
Journal of Mathematics 7
Following eorem 3 and Corollary 6, we give the next
example.
Example 3. e zeros of the Legendre polynomial P2(x)are
x11/
3
and x2� − (1/
3
). us, following Corollary 6
we can construct the Legendre polynomial P3(x)as follows:
P3(x) � 223
5
􏼒 􏼓 5
3
3e(2)
2
1
3
,1
3
􏼠 􏼡x2e(2)
1
1
3
,1
3
􏼠 􏼡x2+5
3e(2)
0
1
3
,1
3
􏼠 􏼡x3
􏼢 􏼣
3
2
5
3x3x
􏼒 􏼓,
(54)
therefore, P3(x) � (1/2)(5x33x).
6. Conclusion
roughout this paper, we provided some results related to
the elementary symmetric polynomials such as Lemmas 1–3.
e importance of the results mentioned in Section 2 ap-
pears by providing some new results related to zeros of the
Legendre polynomials that have been presented in Section 3.
Also, we constructed the Legendre polynomials via their
zeros, and we presented the closed form of Vieta’s formula.
By eorem 3, we were able to construct Pn(x)via the zeros
of Pn1(x)for all n2, which reduce the computational
costs for constructing the Legendre polynomials.
Data Availability
No data were used to support this study.
Conflicts of Interest
e authors declare that they have no conﬂicts of interest.
References
 D. Knutson, l-Rings and the Representation eory of the
Symmetric Group, Springer, Amsterdam, Netherlands, 1973.
 F. Bergeron, Algebraic Combinatorics and Coinvariant Spaces,
CRC Press, Boca Raton, FL, USA, 2009.
 K. D. Boklan, “A note on identities for elementary symmetric
and power sum polynomials,” Discrete Mathematics, Algo-
rithms and Applications, vol. 10, no. 01, Article ID 1850004,
2018.
 I. Kucukoglu and Y. Simsek, “Construction and computation
of uniﬁed Stirling-type numbers emerging from p-adic in-
tegrals and symmetric polynomials,” Revista de la Real Ac-
ısicas y Naturales. Serie
A. Matem´
aticas, vol. 115, no. 4, p. 167, 2021.
 E. Rawashdeh, A Simple Method for Finding the Inverse Matrix
of Vandermonde Matrix, Matematiˇcki Vesnik, Serbia, 2018.
 M. El-Mikkawy and T. Sogabe, “Notes on particular sym-
metric polynomials with applications,” Applied Mathematics
and Computation, vol. 215, no. 9, pp. 3311–3317, 2010.
 I. G. Macdonald, Symmetric Functions and Hall Polynomials,
Oxford University Press, Oxford, UK, 1998.
 M. Merca, “Some experiments with complete and elementary
symmetric functions,” Periodica Mathematica Hungarica,
vol. 69, no. 2, pp. 182–189, 2014.
 M. Merca, “Bernoulli numbers and symmetric functions.
Revista de la Real Academia de Ciencias Exactas, F´
ısicas y
Naturales,” Serie A. Matem´
aticas, vol. 114, no. 1, pp. 1–16,
2020.
 M. El-Mikkawy and F. Atlan, “Remarks on two symmetric
polynomials and some matrices,” Applied Mathematics and
Computation, vol. 219, no. 16, pp. 8770–8778, 2013.
 A. Arafat, P. Gregori, and E. Porcu, “Schoenberg coeﬃcients
and curvature at the origin of continuous isotropic positive
deﬁnite kernels on spheres,” Statistics & Probability Letters,
vol. 156, Article ID 108618, 2020.
 A. Arafat, E. Porcu, M. Bevilacqua, and J. Mateu, “Equivalence
and orthogonality of Gaussian measures on spheres,” Journal
of Multivariate Analysis, vol. 167, pp. 306–318, 2018.
 Q.-M. Luo, “Contour integration for the improper rational
functions,” Montes Taurus Journal of Pure and Applied
Mathematics, vol. 3, no. 3, pp. 135–139, 2021.
 G. Mastroianni and G. Monegato, “Nystr¨om interpolants
based on the zeros of legendre polynomials for a non-compact
integral operator equation,” IMA Journal of Numerical
Analysis, vol. 14, no. 1, pp. 81–95, 1994.
 Y. Simsek, “Applications of constructed new families of
generating-type functions interpolating new and known
classes of polynomials and numbers,” Mathematical Methods
in the Applied Sciences, vol. 44, no. 14, pp. 11245–11268, 2021.
 G. E. Andrews, R. Askey, and R. Roy, Special Functions,
Cambridge University Press, no. 71, Cambridge, UK, 1999.
 L. C. Andrews, Special Unctions of Mathematics for Engineers,
Vol. 49, Spie Press, Bellingham, WA, USA, 1998.
 R. Askey, Orthogonal Polynomials and Special Functions,
 R. Beals and R. Wong, Special Functions and Orthogonal
Polynomials, Vol. 153, Cambridge University Press, Cam-
bridge, UK, 2016.
 G. Freud, Orthogonal Polynomials, Elsevier, Amsterdam,
Netherlands, 2014.
 Y. Simsek, “Generating functions for ﬁnite sums involving
higher powers of binomial coeﬃcients: analysis of hyper-
geometric functions including new families of polynomials
and numbers,” Journal of Mathematical Analysis and Appli-
cations, vol. 477, no. 2, pp. 1328–1352, 2019.
 G. Szeg ¨
o, Orthogonal Polynomials, Vol. 23, American
Mathematical Society, Providence, RI, USA, 1939.
 C. Viola, An Introduction to Special Functions, Springer,
Berlin, Germany, 2016.
 T. Wang and L. Qiao, “Some identities and inequalities in-
volving symmetry sums of legendre polynomials,” Symmetry,
vol. 11, no. 12, p. 1521, 2019.
 F. Lether and P. Wenston, “Minimax approximations to the
zeros of Pn(x)and gauss-legendre quadrature,” Journal of
8Journal of Mathematics
Computational and Applied Mathematics, vol. 59, no. 2,
pp. 245–252, 1995.
 N. A. Gumerov and R. Duraiswami, Fast Multipole Methods
for the Helmholtz Equation in ree Dimensions, Elsevier,
Amsterdam, Netherlands, 2005.
 E. D. Bloch, e Real Numbers and Real Analysis, Springer
Science & Business Media, Berlin, Germany, 2011.
 I. Gelfand and V. Retakh, “Noncommutative vieta theorem
and symmetric functions,” in e Gelfand Mathematical
Seminars, pp. 93–100, Springer, Berlin, Germany, 1996.
Journal of Mathematics 9