"2 x 3" primes naming "6": evidence from masked priming

It is a common assumption for multiplication-solving models that single-digit multiplications are automatically retrieved. However, the experimental evidence for this is based on paradigms under suspicion. In this research, we employed a new procedure with the aim of assessing the automatic retrieval of multiplication more directly. In two experiments, multiplication automatism was studied using briefly presented primes (stimulus onset asynchrony = 48 msec) in a number-naming task. In Experiment 1, in the congruent conditions, the target and the prime were the same numbers (e.g., prime, 6; target, 6) or the target was the solution to the multiplication prime (e.g., prime, 2 x 3 = ; target, 6). In the incongruent conditions, no relationship existed between the primes and the targets (e.g., prime, 32; target, 6; or prime, 4 x 8 = ; target, 6). Experiment 2 explored the relevance of the equal sign for the multiplication-priming effect. Data showed that naming was faster when the solution of the multiplication prime matched the target, as compared with the incongruent condition (multiplication-priming effect), and that these effects were found irrespective of the presence of the equal sign. The fact that this priming effect was found even though the participants were unaware of the presentation of the primes supports the automatic character of single-digit multiplication. We conclude by arguing that this procedure is highly valuable for exploring the mechanisms involved in simple arithmetic solving.