A Combinatorial Generalization of a Putnam Problem

DOI10.2307/2325062zbMATH Open0772.11006OpenAlexW2155331116MaRDI QIDQ4013201FDOQ4013201

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

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

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)

Cited In (13)

• A Combinatorial Proof for Stockhausen's Problem
• Functions with constant mean on similar countable subsets of \(\mathbb R^2\)
• Title not available (Why is that?)
• Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
• Title not available (Why is that?)
• On the existence of n but not n + 1 easy combinators
• Title not available (Why is that?)
• A combinatorial result related to the consistency of New Foundations
• Title not available (Why is that?)
• A generalization of an IMO problem
• Title not available (Why is that?)
• EXTENDING A PUTNAM PROBLEM TO FIELDS OF VARIOUS CHARACTERISTICS
• Title not available (Why is that?)

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)