On perfect, amicable, and sociable chains
Combinatorics
2010-11-19 v1 Discrete Mathematics
Number Theory
Abstract
Let be an n-chain, i.e., an n-tuple of non-negative integers . Consider the operator , where x'_j represents the number of 's appearing among the components of x. An n-chain x is said to be perfect if . For example, (2,1,2,0,0) is a perfect 5-chain. Analogously to the theory of perfect, amicable, and sociable numbers, one can define from the operator s the concepts of amicable pair and sociable group of chains. In this paper we give an exhaustive list of all the perfect, amicable, and sociable chains.
Cite
@article{arxiv.0708.1491,
title = {On perfect, amicable, and sociable chains},
author = {Jean-Luc Marichal},
journal= {arXiv preprint arXiv:0708.1491},
year = {2010}
}
Comments
10 pages