scientific article; zbMATH DE number 5302138

MaRDI QIDQ3512705zbMATH OpenFDO

Authors Adrian Dumitrescu, Guangwu Xu

Publication date 21 July 2008

zbMATH Keywords

efficient algorithmrepresentation of polynomials as sum of two polynomialsrepresentation problems with infinite multiplicity

Mathematics Subject Classification ID

Representation problems (11D85) Additive number theory; partitions (11P99) Polynomials (irreducibility, etc.) (11R09)

Recommendations

• scientific article; zbMATH DE number 20902
• Sums of Powers of Integers
• scientific article; zbMATH DE number 4160828
• The polynomial sieve and equal sums of like polynomials
• Polynomials with Large Numbers of Prime Values
• scientific article; zbMATH DE number 4114741
• Is every polynomial with integer coefficients near an irreducible polynomial?
• Squares from Products of Consecutive Integers
• Representations of numbers as sums and differences of unlike powers
• Composite values of irreducible polynomials

Cited in

(5)

• An algorithmic approach to some problems on the representation of natural numbers as sums without repetitions
• scientific article; zbMATH DE number 4103173 (Why is no real title available?)
• scientific article; zbMATH DE number 20902 (Why is no real title available?)
• The polynomial sieve and equal sums of like polynomials
• Expressing an integer as a sum of cubes of polynomials

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512705)