s426179/DALGLI0
1
0
Fork 0
forked from kalmar/DALGLI0
Code Releases Activity

spacing

Browse Source
This commit is contained in:
kalmarek 2018-05-18 11:58:52 +02:00
parent 8bf068c6fe
commit 679f76a102
1 changed files with 7 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
01-Pierścień-Zn.md
View File

@ -1,22 +1,19 @@
## Zadanie
Napisać algorytm, który dla danego `n ∈ ℕ` znajdzie wszystkie:
1. elementy odwracalne
2. dzielniki zera
3. elementy nilpotentne
4. elementy idempotentne
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]]`
> 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]]`