# Talk:Modular arithmetic

## using (or not) existing libraries

The purpose of this task is to show, if your programming language allows it, how to redefine operators so that they can be used transparently on modular integers. You can do it either by using a dedicated library, or by implementing your own class.

This is a nice interesting task description - although it would be much more interesting if one can't use a library. The interesting part in my view is how to redefine operators. Allowing implementations to use a library hides the interesting part.

It is important that the function f is agnostic about whether or not its argument is modular. It should behave the same way with normal and modular integers. In other words, the function is an algebraic expression that could be used with any ring, not just integers.

For languages that represent elements in, says, Z/5Z as the integers 0,1,2,3,4 there is no way to distinguish an element of Z/5Z from n element in Z. That is, one is forced not to use existing libraries. This will make functional solutions to this task look longer than object oriented languages.

I therefore suggest that all solutions should show how to redefine operators/numbers without using existing libraries.

(This was written by Soegaard (Talk | contribs) at 21:22, 11 March 2013‎)
Even using a library is not without interest imho, as it shows the reader how the library is named and how it is used. For instance, it's not so easy to find out the name 'Mod::Int' when you never heard of it.
As for redefining operator, I guess it could be a task by itself.--Grondilu 22:32, 11 March 2013 (UTC)

## Task should spell out more examples

This task lists a variety of constraints, but then asks for only a single result.

Ideally, it should include one or two examples for each of the significant cases being described. --Rdm (talk) 15:27, 27 April 2022 (UTC)

## Can x be negative and the exponent odd?

```i.e f x = x^199 + x + 1 with x being -23. --Nigel Galloway (talk) 18:39, 27 February 2024 (UTC)
```