Re: Hansen chains do not always produce optimum addition chains
- From: Gerry Myerson <gerry@xxxxxxxxxxxxxxxxxxxxxxxxx>
- Date: Mon, 01 Aug 2005 16:20:27 +1000
In article <42edacbd$1@xxxxxxxxxxxxxxxxxx>,
"Neill Clift [MSFT]" <neillc@xxxxxxxxxxxxx> wrote:
> In The Art of Computer Programming, Third Edition, Vol. 2, 4.6.3,
> Page 485, question 42 is:
> 'Is l(2n-1) ? n - 1 - l(n) for all positive integers n? Does equality
> always hold? Does l(n) = l0(n)?'.
You must be using some symbols that don't come through on my machine.
The question in Knuth (although I'm looking at 2nd edition) is
'Is l(2^n - 1) less than or equal to n - 1 + l(n) for all positive
integers n? Does equality always hold? Does l(n) = l^0(n)?'
I can't help you with anything, but I wonder whether you have seen
the discussion at problem C6 of the 3rd edition of Guy's Unsolved
Problems in Number Theory. Guy has a long bibliography.
If you've discovered something that's not in Guy's book,
he'd probably appreciate it if you send him whatever
you've got written up for inclusion in a 4th edition.
--
Gerry Myerson (gerry@xxxxxxxxxxxxxxx) (i -> u for email)
.
- Follow-Ups:
- Re: Hansen chains do not always produce optimum addition chains
- From: Neill Clift [MSFT]
- Re: Hansen chains do not always produce optimum addition chains
- References:
- Hansen chains do not always produce optimum addition chains
- From: Neill Clift [MSFT]
- Hansen chains do not always produce optimum addition chains
- Prev by Date: Re: Combining Conditional Probabilities
- Next by Date: Re: The Mathematics behind a Sports Book
- Previous by thread: Hansen chains do not always produce optimum addition chains
- Next by thread: Re: Hansen chains do not always produce optimum addition chains
- Index(es):
Relevant Pages
|