|
|
![[parent]](http://images.planetmath.org:8080/images/uparrow.png) Viewing Message
|
|
|
| ``Re: Mian-Chowla question''
by CompositeFan on 2006-12-12 10:33:58 |
|
| The definition that is repeated by many sources roughly goes like this:
a_1 = 1. For n > 1, using the greedy algorithm, choose for a_n the smallest integer such that each a_i + a_j for 0 < i <= n and 0 < j <= n is unique (the pairwise sums).
Some definitions also specify that i = j is not considered, others add that maybe i = j is allowed when also i = j = n.
From what I can tell, the original definition is in a paper in an Indian journal, but since I can't read Indian, I don't even dare look up that paper.
As a woman, and uninterested in knowledge encryption as so many men are, I can admit that I don't understand exactly how the greedy algorithm fits into this. I understand how it applies to making change given a set of coin or bill currency, but I'm not sure how it works here.
At the very least I have to applaud PrimeFan's courage in admitting to not understanding something. Such an admission doesn't make you any less of a man.
|
| | [ reply | up | top ] | |
|
|
|
|
|
|
|
