•  
  •  
 

Abstract / Synopsis

A binary operation # on Z+ is said to be an associative arithmetic if both # and its iteration — the binary operation ∗ defined recursively by: x∗1 = x and x∗y = [x ∗ (y − 1)]#x — are associative. E. Rosinger [6] showed that under reasonable conditions an associative arithmetic must be ordinary addition. However, in the general case, there are associative arithmetics that are not ordinary addition. This paper gives examples of these as well as results towards a structure theorem for associative arithmetics. The paper also describes the role that this particular math problem has played in my mathematical life.

DOI

10.5642/jhummath.JDEM9972

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

Share

COinS