Re: Hard problem

From: "Chip Eastham" <hardmath@xxxxxxxxx>
Date: 1 Dec 2005 14:44:47 -0800

Ken Pledger wrote:
> In article <dmng2j$dt8$1@xxxxxxxxxxxxxxxxx>,
> rusin@xxxxxxxxxxxxxxxxxxxxx (Dave Rusin) wrote:
>
> > ....
> > PS -- Saturday Dec 3 is the 2005 Putnam contest in the US. People are
> > asked to refrain from posting solutions until the westernmost test-takers
> > are finished late in their afternoon....
>
>
> Fair enough; but is there some way to recognize what is a Putnam
> problem?
>
> Ken Pledger.

A necessary condition is a math problem concisely stated and baffling.

To be sure, one needs access to a Robert Israel oracle. If a polished
solution pops out before you can get your fingers off the keyboard,
then
it's a Putnam problem.

:-)

-- chip

.

References:
- Hard problem
  - From: Peper
- Re: Hard problem
  - From: Dave Rusin
- Re: Hard problem
  - From: Ken Pledger

Prev by Date: Re: Condition on two beta distributions
Next by Date: Re: ? what is the x maximizing norm(b) where b = A*x
Previous by thread: Re: Hard problem
Next by thread: Re: Hard problem
Index(es):
- Date
- Thread

Relevant Pages

Re: Hard problem
... rusin@xxxxxxxxxxxxxxxxxxxxx (Dave Rusin) wrote: ... > asked to refrain from posting solutions until the westernmost test-takers ...
(sci.math)
Re: Hard problem
... Could someone please post a message next year when the take-home part ... asked to refrain from posting solutions until the westernmost test-takers ...
(sci.math)
Re: Hard problem
... >> asked to refrain from posting solutions until the westernmost test-takers ... to anything that has the flavor of a Putnam problem. ...
(sci.math)