1
0
forked from kalmar/DALGLI0
DALGLI0/01-Pierścień-Zn.md
2018-05-18 11:57:23 +02:00

23 lines
369 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

## Zadanie
Napisać algorytm, który dla danego `n ∈ ` znajdzie wszystkie:
1. elementy odwracalne
2. dzielniki zera
3. elementy nilpotentne
4. elementy idempotentne
w pierścieniu `{/n, +, ⋅}`.
### Przykłady:
* Input:
> `4`
* Output:
> `[[1,3], [0,2], [0,2], [0,1]]`
* Input:
> `6`
* Output:
> `[[1,5], [0,2,3,4], [0], [0,1,3,4]]`