Re: Programming Contest

From: "David C. Hoos" <david.c.hoos.sr@ada95.com>
To: <comp.lang.ada@ada.eu.org>
Subject: Re: Programming Contest
Date: Mon, 23 Jul 2001 06:44:21 -0500
Date: 2001-07-23T06:44:21-05:00	[thread overview]
Message-ID: <mailman.995888729.11518.comp.lang.ada@ada.eu.org> (raw)
In-Reply-To: Pine.LNX.4.33.9901111915230.32622-100000@lagoa.niaad.liacc.up.pt

The conjecture is false.

----- Original Message ----- 
From: "M. A. Alves" <maa@liacc.up.pt>
To: <comp.lang.ada@ada.eu.org>
Sent: Monday, January 11, 1999 2:29 PM
Subject: Re: Programming Contest

> Conjecture: Solution (greatest possible smallest unattainable score)  =
> Greatest_Attainable_Score + 1, i.e. the set of attainable scores
> associated with Solution has no holes (i.e. all scores below Solution are
> attainable).
> 
> Is anyone sure this conjecture is false? (No proof asked :-)
> 
> -- 
>    ,
>  M A R I O   data miner, LIACC, room 221   tel 351+226078830, ext 121
>  A M A D O   Rua Campo Alegre, 823         fax 351+226003654
>  A L V E S   P-4150 PORTO, Portugal        mob 351+939354002
> 
> 
> 
> _______________________________________________
> comp.lang.ada mailing list
> comp.lang.ada@ada.eu.org
> http://ada.eu.org/mailman/listinfo/comp.lang.ada
> 