A Combinatorial Generalization of a Putnam Problem

DOI10.2307/2325062MaRDI QIDQ4013201zbMATH OpenOpenAlexFDO

Authors Ömer Eğecioğlu

Publication date 27 September 1992

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c49971528dadd96ba2a39e5b9f82585bcc582ddd

zbMATH Keywords

cyclotomic polynomialscombinatorial proofsequence of integers

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Special sequences and polynomials (11B83) Polynomials and matrices (11C99)

Recommendations

• A generalization of an IMO problem
• Nikolai Ivanovich Lobachevskii (on the bicentenary of his birth)
• Combinatorial Etudes and Number Theory
• On a combinatorial problem of Erdős, Ginzburg, and Ziv
• An \(m\)-ary partition generalization of a past Putnam problem

Cited in

(13)

• scientific article; zbMATH DE number 5284568 (Why is no real title available?)
• A generalization of an IMO problem
• On the existence of n but not n + 1 easy combinators
• EXTENDING A PUTNAM PROBLEM TO FIELDS OF VARIOUS CHARACTERISTICS
• Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
• scientific article; zbMATH DE number 1735725 (Why is no real title available?)
• scientific article; zbMATH DE number 5944482 (Why is no real title available?)
• Functions with constant mean on similar countable subsets of \(\mathbb R^2\)
• A Combinatorial Proof for Stockhausen's Problem
• scientific article; zbMATH DE number 741508 (Why is no real title available?)
• A combinatorial result related to the consistency of New Foundations
• scientific article; zbMATH DE number 6680999 (Why is no real title available?)
• scientific article; zbMATH DE number 3979053 (Why is no real title available?)

This page was built for publication: A Combinatorial Generalization of a Putnam Problem

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