A Family of Fractal-Based Irreducible Polynomials.

Saved in:
Bibliographic Details
Title: A Family of Fractal-Based Irreducible Polynomials.
Authors: Laudano, Francesco1 frlaud.fl@gmail.com
Source: Mathematics Magazine. Dec2024, Vol. 97 Issue 5, p510-514. 5p.
Subject Terms: Irreducible polynomials, Pascal's triangle, Mathematical variables, Automorphisms, Addition (Mathematics)
Abstract: Summary: We provide some fractal-based irreducibility criteria for integer polynomials. The results are obtained using the self-similar pattern of Pascal's triangle modulo two and by applying a restatement of the Schönemann–Eisenstein's irreducibility criterion. [ABSTRACT FROM AUTHOR]
Copyright of Mathematics Magazine is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Education Research Complete
Full text is not displayed to guests.
Description
Abstract:Summary: We provide some fractal-based irreducibility criteria for integer polynomials. The results are obtained using the self-similar pattern of Pascal's triangle modulo two and by applying a restatement of the Schönemann–Eisenstein's irreducibility criterion. [ABSTRACT FROM AUTHOR]
ISSN:0025570X
DOI:10.1080/0025570X.2024.2406723