The man places pennies on the squares of a chess board according to a pattern where each square \( n \) contains \( 2^{(n-1)} \) pennies.
-
For square 1, the number of pennies is: \[ 2^{(1-1)} = 2^0 = 1 \text{ penny} \]
-
For square 2, the number of pennies is: \[ 2^{(2-1)} = 2^1 = 2 \text{ pennies} \]
-
For square 3, the number of pennies is: \[ 2^{(3-1)} = 2^2 = 4 \text{ pennies} \]
-
For square 4, the number of pennies is: \[ 2^{(4-1)} = 2^3 = 8 \text{ pennies} \]
Continuing this pattern, we see that for square \( n \), the number of pennies is \( 2^{(n-1)} \).
To find the number of pennies on the 14th square: \[ \text{Number of pennies on square 14} = 2^{(14-1)} = 2^{13} \]
Now, we need to calculate \( 2^{13} \): \[ 2^{13} = 8192 \]
Thus, the number of pennies on the 14th square is: \[ \boxed{8192} \]