Reference : On perfect, amicable, and sociable chains
E-prints/Working papers : Already available on another site
Physical, chemical, mathematical & earth Sciences : Mathematics
On perfect, amicable, and sociable chains
Marichal, Jean-Luc mailto [University of Liège, Belgium > Institute of Mathematics]
[en] partitions of integers ; finite integer sequences
[en] Let $\bfx = (x_0,\ldots,x_{n-1})$ be an $n$-chain, i.e., an $n$-tuple of non-negative integers $< n$. Consider the operator $s: \bfx \mapsto\bfx' = (x'_0,\ldots,x'_{n-1})$, where $x'_j$ represents the number of $j$'s appearing among the components of $\bfx$. An $n$-chain $\bfx$ is said to be perfect if $s(\bfx) = \bfx$. 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.
Researchers ; Professionals ; Students

File(s) associated to this reference

Fulltext file(s):

Open access
PerfectChains.pdfAuthor postprint142.7 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.