Abstract
The orchard problem, also known as the three-planting problem in the literature, is to plant n trees so that there will be r straight rows with k trees in each row. The maximum r for various k is unknown except for certain small cases of n and k. We have constructed examples of known maximums using words which we call Orchard Words.
| Original language | American English |
|---|---|
| Journal | Word Ways |
| State | Published - Nov 1 2006 |
Keywords
- Linguistic
Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS