2016 Update
This commit is contained in:
parent
948b86eafa
commit
dcf5d15da3
7965 changed files with 139854 additions and 31002 deletions
|
|
@ -1,6 +1,8 @@
|
|||
The objective of this task is to create a reasonably complete implementation of rational arithmetic in the particular language using the idioms of the language.
|
||||
;Task:
|
||||
Create a reasonably complete implementation of rational arithmetic in the particular language using the idioms of the language.
|
||||
|
||||
For example:
|
||||
|
||||
;Example:
|
||||
Define a new type called '''frac''' with binary operator "//" of two integers that returns a '''structure''' made up of the numerator and the denominator (as per a rational number).
|
||||
|
||||
Further define the appropriate rational unary '''operators''' '''abs''' and '-', with the binary '''operators''' for addition '+', subtraction '-', multiplication '×', division '/', integer division '÷', modulo division, the comparison operators (e.g. '<', '≤', '>', & '≥') and equality operators (e.g. '=' & '≠').
|
||||
|
|
@ -12,5 +14,7 @@ If space allows, define standard increment and decrement '''operators''' (e.g. '
|
|||
Finally test the operators:
|
||||
Use the new type '''frac''' to find all [[Perfect Numbers|perfect numbers]] less than 2<sup>19</sup> by summing the reciprocal of the factors.
|
||||
|
||||
'''See also'''
|
||||
* [[Perfect Numbers]]
|
||||
|
||||
;Related task:
|
||||
* [[Perfect Numbers]]
|
||||
<br><br>
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue