Root of unity modulo n
id:
root-of-unity-modulo-n-254-17069579
title:
Root of unity modulo n
text:
In number theory, a kth root of unity modulo n for positive integers k, n ≥ 2, is a root of unity in the ring of integers modulo n; that is, a solution x to the equation x k ≡ 1 . If k is the smallest such exponent for x, then x is called a primitive kth root of unity modulo n. See modular arithmetic for notation and terminology. The roots of unity modulo n are exactly the integers that are coprime with n. In fact, these integers are roots of unity modulo n by Euler's theorem, and the other inte
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Root_of_unity_modulo_n
date created:
date modified:
2024-02-26T09:56:13Z
main entity:
{"identifier":"Q7366581","url":"https://www.wikidata.org/entity/Q7366581"}
image:
fields total:
13
integrity:
13