Abstract
What started off as an enrichment assignment for a third grader has developed into a rich source of programming assignments. The long integers, needed to determine whether a number eventually becomes a palindrome under the process of reversal and addition, can be described as an abstract data type and implemented as a C++ class. There are intriguing open questions which call for great creativity and efficiency in terms of data structures. Even graphics have been employed to illuminate the problem. The next step is probably parallel processing.
- 1 C.W. THgg, Palindromes by Addition. Mathematics Magazine~ 40, 26-28 (1967).Google Scholar
Cross Ref
- 2 C.W. Trigg, More on Palindromes by Reversal-addition. Mathematics Magazine, 45, 184-186 (1972).Google Scholar
Cross Ref
- 3 H. Harborth, on Palindromes, Mathematics Magazine, 46, 96-99 (1973).Google Scholar
Cross Ref
- 4 Ryan Richardson and Christine Shannon, Palindrome Pictures, Computers and Graphics, 20, 597-603 (1996).Google Scholar
Cross Ref
Index Terms
LongNbrs and palindromes: an interesting application of a class
Recommendations
On k-abelian palindromes
A word is called a palindrome if it is equal to its reversal. In the paper we consider a k-abelian modification of this notion. Two words are called k-abelian equivalent if they contain the same number of occurrences of each factor of length at most k. ...
LongNbrs and palindromes: an interesting application of a class
SIGCSE '98: Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science educationWhat started off as an enrichment assignment for a third grader has developed into a rich source of programming assignments. The long integers, needed to determine whether a number eventually becomes a palindrome under the process of reversal and ...
Palindromic Length of Words with Many Periodic Palindromes
Descriptional Complexity of Formal SystemsAbstractThe palindromic length of a finite word v is the minimal number of palindromes whose concatenation is equal to v. In 2013, Frid, Puzynina, and Zamboni conjectured that: If w is an infinite word and k is an integer such that for every factor u of ...






Comments