update meta data
This commit is contained in:
parent
f3a896c724
commit
90e15ed6ce
3307 changed files with 1674 additions and 7 deletions
16
Task/Arithmetic-Rational/00DESCRIPTION
Normal file
16
Task/Arithmetic-Rational/00DESCRIPTION
Normal file
|
|
@ -0,0 +1,16 @@
|
|||
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.
|
||||
|
||||
For 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. '=' & '≠').
|
||||
|
||||
Define standard coercion '''operators''' for casting '''int''' to '''frac''' etc.
|
||||
|
||||
If space allows, define standard increment and decrement '''operators''' (e.g. '+:=' & '-:=' etc.).
|
||||
|
||||
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]]
|
||||
Loading…
Add table
Add a link
Reference in a new issue