We might expect this would be straightforward. The number in each box is determined by numbers in two or more boxes of the row above. This should be made to be simulated by CA. In some way it is, and as long as we are interested only in even-or-odd distinctions, this is fairly straightforward to do using binary CA. See the CA section of other questions, for an example.
When we ask for mods other than 2, the problem becomes more challenging with binary CA. Can binary CA with larger neighborhoods reproduce the behavior of CA with more states and smaller neighborhoods? See what you can find.
Binary problems should be accessible with binary CA. Here is one exercise, for practice.
1. Find a CA to reproduce the pattern obtained by shading the odd numbers in Pascal's
triangle for
Return to Exercises.