MathDB
Infinitely Many Descendants

Source: IMO LongList 1982 - P24

March 18, 2011
inductiongraph theorycombinatorics unsolvedcombinatorics

Problem Statement

Prove that if a person a has infinitely many descendants (children, their children, etc.), then a has an infinite sequence a0,a1,a_0, a_1, \ldots of descendants (i.e., a=a0a = a_0 and for all n1,an+1n \geq 1, a_{n+1} is always a child of ana_n). It is assumed that no-one can have infinitely many children.
Variant 1. Prove that if aa has infinitely many ancestors, then aa has an infinite descending sequence of ancestors (i.e., a0,a1,a_0, a_1, \ldots where a=a0a = a_0 and ana_n is always a child of an+1a_{n+1}).
Variant 2. Prove that if someone has infinitely many ancestors, then all people cannot descend from A(dam)A(dam) and E(ve)E(ve).