Quantum

[ Information | Background | The CyberTeaser | Quantum News | Miscellaneous Stuff ]

Quantum CyberTeaser: January/February 1999


B254

Short stack. A total of n cards numbered 1 through n is divided into two stacks. What is the minimum value of n such that at least one stack will include a pair of cards whose numbers add up to an exact square?

Solution

N on his mind!

The winners:

  • Bob Cordwell (Ellicott City, Maryland)
  • Max Bachmutsky (Kfar-Sava, Israel)
  • Matthew Wong (Edmonton, Alberta)
  • Leonid Borovskiy (Brooklyn, New York)
  • Elio Abbondanzieri (Houston, Texas)
  • Nick Baxter (Hillsborough, California)
  • John Beam (Bellaire, Texas)
  • Anastasia Nikitina (Pasadena, California)
  • Andrei Cipu (Bucharest, Romania)
  • Helio Waldman (Campinas, Brazil)

CyberTeaser Archive


Quantum Control Panel
Information | Background | The CyberTeaser | Quantum News | Miscellaneous Stuff


Copyright 1999 National Science Teachers Association
All rights reserved