Talk:Proof: Difference between revisions
Content added Content deleted
(→Clarification needed: new section) |
Underscore (talk | contribs) |
||
| Line 17: | Line 17: | ||
The first line of the description reads: <cite>"Define a type for a sub-set of natural numbers (0, 1, 2, 3, ...) representable by a computer, and addition on them."</cite> Can somebody please clarify that last phrase, <cite>"addition on them"</cite>? I ''think'' I know what it's supposed to mean (and I'm ''fairly'' sure I understand the task as a whole) but just in case... -- [[User:Eriksiers|Eriksiers]] 22:24, 5 November 2009 (UTC) |
The first line of the description reads: <cite>"Define a type for a sub-set of natural numbers (0, 1, 2, 3, ...) representable by a computer, and addition on them."</cite> Can somebody please clarify that last phrase, <cite>"addition on them"</cite>? I ''think'' I know what it's supposed to mean (and I'm ''fairly'' sure I understand the task as a whole) but just in case... -- [[User:Eriksiers|Eriksiers]] 22:24, 5 November 2009 (UTC) |
||
:In mathematics, when we speak of "a binary operation on S", we mean a function whose domain is S × S and whose codomain is S. So "addition on the natural numbers" means an addition function that takes two naturals and returns a natural. —[[User:Underscore|Underscore]] 00:42, 6 November 2009 (UTC) |
|||