Sieving Polynomial via Parametrization for Factorization of Some Special Forms
DOI:
https://doi.org/10.9734/bpi/rhmcs/v3/17116DKeywords:
Factorization, quadratic equation, parametrization, sieving polynomialAbstract
In 1998 zhang developed a method which can factor integers of the form x3+...+a0 for a0 << m. In 2022 Eric Landquist [1] generalised the method for numbers of the form n = m5 + a0. In this paper going in the lines of Eric, we propose some non trivial parametrizations and obtain a sieving polynomial for factoring of the numbers of the form n = m5 + a4m4 + a3m3 + a2m2 + a1m + a0 with ai << m.
Published
2022-12-14
How to Cite
P. Anuradha Kameswari, & G. Surya Kantham. (2022). Sieving Polynomial via Parametrization for Factorization of Some Special Forms. Research Highlights in Mathematics and Computer Science Vol. 3, 49–60. https://doi.org/10.9734/bpi/rhmcs/v3/17116D
Issue
Section
Chapters