Differences in event-related potential (ERP) responses to small tie, non-tie and 1-problems in addition and multiplication.

Abstract Using ERP, we investigated the cause of the tie advantage according to which problems with repeated operands are solved faster and more accurately than non-tie problems. We found no differences in early or N400 ERP components between problems, suggesting that tie problems are not encoded faster or suffer from less interference than non-tie problems. However, a lesser negative amplitude of the N2 component was found for tie than non-tie problems. This suggests more working-memory and attentional resource requirements for non-tie problems and therefore more frequent use of retrieval for tie than non-tie problems. The possible peculiarity of problems involving a 1 was also investigated. We showed less negative N2 amplitudes for these problems than for other non-tie problems, suggesting less working-memory resources for 1-problems than other non-tie problems. This could be explained either by higher reliance on memory retrieval for 1-problems than non-1 problems or by the application of non-arithmetical rules for 1-problems.