A Number-Theoretic Proof of the Solvability of Polynomials

20230 citationsPreprintdiamond Open Access

Authors

Shahid Nawaz · Development Authority of the North Country

Abstract

In this paper, we prove the solvability of polynomials based on partition function in number theory. Let \(p(n)\) be the partition function, where \(n\) is the degree of a polynomial. We prove that a polynomial is solvable by radicals if \(p(n)\leq n+1\).

Topics & Keywords

Advanced Mathematical Identities Advanced Combinatorial Mathematics Analytic Number Theory Research

Publication Details

Published in: Qeios

DOI: 10.32388/8aoidt

Field-Weighted Citation Impact: 0.00

Command Palette

A Number-Theoretic Proof of the Solvability of Polynomials

Authors

Abstract

Topics & Keywords

Publication Details