Abstract
From the information given we know that the top hymn number cannot exceed 329, as three times this amount, the bottom hymn number, would have more than three digits. The top number is generated, without duplication of digits, in three FOR/NEXT loops; the value is multiplied by two and three to obtain the two other numbers. These two are combined in a string and checked, first for duplication of digits in itself, and then against the original number.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1983 Birkhauser Boston, Inc.
About this chapter
Cite this chapter
Lee, G., Scrimshaw, N.B. (1983). Programs. In: The Commodore Puzzle Book. Birkhäuser Boston. https://doi.org/10.1007/978-1-4684-6738-3_3
Download citation
DOI: https://doi.org/10.1007/978-1-4684-6738-3_3
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-3167-3
Online ISBN: 978-1-4684-6738-3
eBook Packages: Springer Book Archive