On perfect, amicable, and sociable chains

Details On perfect, amicable, and sociable chains On perfect, amicable, and sociable chains

2007-08-10

arxiv.org/abs/0708.1491v1

Mathematics

Combinatorics

10 pages

Scientific paper

Let $x = (x_0,...,x_{n-1})$ be an n-chain, i.e., an n-tuple of non-negative integers $< n$. Consider the operator $s: x \mapsto x' = (x'_0,...,x'_{n-1})$, where x'_j represents the number of $j$'s appearing among the components of x. An n-chain x is said to be perfect if $s(x) = x$. 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.

Affiliated with

Also associated with

No associations

Rating

On perfect, amicable, and sociable chains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On perfect, amicable, and sociable chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On perfect, amicable, and sociable chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-47266