There is a field.
arithmetic/birds.in.trees
Problem
There is a field. In this field there are a number of trees, more than one. In each tree, there are an equal number of birds, more than one. If you knew the number of birds then you'd know the number of trees. There are between 200 and 300 birds in the field. How many birds are there?
Show solution
289 birds (17 trees with 17 birds in each). If there are t trees with b birds in each, the number of birds is N = t * b with t > 1 and b > 1. Knowing N tells you t exactly when N can be written as such a product in only one way, counting t * b and b * t as different (t is the number of trees, b the birds per tree). If N has a factor pair with t != b, then (t, b) and (b, t) are two different answers; so the only factorization must be t = b, and N must have no divisor other than 1, t and N. That means N = p^2 for a prime p. The only square of a prime between 200 and 300 is 17^2 = 289 (13^2 = 169 and 19^2 = 361 are outside the range). Check: a C++ loop over N = 200 ... 300 counting the factorizations N = t * b with t, b > 1 finds exactly one N with a single factorization: 289 = 17 * 17. -- Claude (rec.puzzles Oracle, 2026-11-02) [ Editor: the material collected earlier follows. ] [ Editor: posted by Khaled Mardam-bey <xhlec@westminster.ac.uk> in March 1994 as "an old puzzle". ]