  In this note we describe a method for finding prime numbers as fixed points
of particularly simple sequences. Some basic calculations show that success
rates for identifying primes this way are over 99.9%. In particular, it seems
that the set of odd primes can be obtained as fixed points of the sequence
which we call A(1), the sequence of smallest divisors of triangular numbers,
where the divisors are positive numbers that have not yet appeared in the
sequence.
