⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

August 1, 1969American Mathematical Monthly

An Irreducibility Criterion for Polynomials Over the Integers

Warren S. Brown R. L. Graham

View at Publisher

Ask AI

Bookmark

Share

Abstract

(1969). An Irreducibility Criterion for Polynomials Over the Integers. The American Mathematical Monthly: Vol. 76, No. 7, pp. 795-797.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Brown et al. (1969) studied this question.

synapsesocial.com/papers/6a1bcce669a4af5b15a906f6 https://doi.org/10.1080/00029890.1969.12000326

View at Publisher

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 related papers. Consider them for comparative context:

1Thinking AI: How Artificial Intelligence Emulates Human UnderstandingAmerican Mathematical Monthly · Thu,
2Problems and SolutionsAmerican Mathematical Monthly · Mon,
3On the Asymptotic Density of Fermat Pseudoprimes to a Fixed BaseAmerican Mathematical Monthly · Wed,
4On Infinite Versions of the Prisoner ProblemAmerican Mathematical Monthly · Fri,
5Vector Identities Related to the Newton–Gauss Line and Pappus’s TheoremAmerican Mathematical Monthly · Mon,

More from American Mathematical Monthly

A New Proof for The Banach–Zarecki TheoremMon,
The Rotational TraceMon,
The Maximum Variance of a Finite Sequence, Given Its Mean, Minimum, and MaximumMon,
A New Proof Using Cones for Archimedes’ Volume Propositions on Conoids and SpheroidsMon,
Maps Preserving the Sum-to-Difference RatioMon,