Related papers: A Complex Primitive $N$th Root Of Unity: A Very El…

This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.

Multiplicative order of an element $a$ of group $G$ is the least positive integer $n$ such that $a^n=e$, where $e$ is the identity element of $G$. If the order of an element is equal to $|G|$, it is called generator or primitive root. This…

The $n^{th}$ cyclotomic polynomial $\Phi_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Hence $\Phi_n(x)$ is trivially zero at primitive $n^{th}$ roots of unity. Using finite Fourier analysis we derive a formula for…

Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*,$ then we say that $g$ is a $t$-near primitive root modulo $p$. We point out the easy result that each primitive residue class contains a…

Modulo a prime number, we define semi-primitive roots as the square of primitive roots. We present a method for calculating primitive roots from quadratic residues, including semi-primitive roots. We then present progressions that generate…

Using matrix function theory, Perron-Frobenius theory, combinatorial matrix theory, and elementary number theory, we characterize, classify, and describe in terms of the Jordan canonical form the matrix pth-roots of imprimitive irreducible…

It is well known that sin(a\pi/b), cos(a\pi/b), etc., are only rational numbers for a few select integers a and b. We show that this is equivalent to the fact that only for d = 1,2,3,4, and 6 is the primitive dth root of unity of degree 2…

This expository article introduces the topic of roots in a compact Lie group. Compared to the many other treatments of this standard topic, I intended for mine to be relatively elementary, example-driven, and free of unnecessary…

The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…

Consider the $m$-th roots of unity in {\bf C}, where $m>0$ is an integer. We address the following question: For what values of $n$ can one find $n$ such $m$-th roots of unity (with repetitions allowed) adding up to zero? We prove that the…

This text provides very easy and short proofs of some basic properties of complex power series (addition, subtraction, multiplication, division, rearrangement, composition, differentiation, uniqueness, Taylor's series, Principle of…

This paper studies simplicity, primitivity and semiprimitivity of algebras associated to \'etale groupoids. Applications to inverse semigroup algebras are presented. The results also recover the semiprimitivity of Leavitt path algebras and…

We consider an analogue of Artin's primitive root conjecture for units in real quadratic fields. Given such a nontrivial unit, for a rational prime p which is inert in the field the maximal order of the unit modulo p is p+1. An extension of…

Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…

Let $k$ be a field and let $R$ be a countable dimensional prime von Neumann regular $k$-algebra. We show that $R$ is primitive, answering a special case of a question of Kaplansky.

We establish necessary and sufficient conditions on a (not necessarily countable) graph E for the graph C*-algebra C*(E) to be primitive. Along with a known characterization of the graphs E for which C*(E) is prime, our main result provides…

Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…

The unit cost model is both convenient and largely realistic for describing integer decision algorithms over (+,*). Additional operations like division with remainder or bitwise conjunction, although equally supported by computing hardware,…

We construct a non-separable C*-algebra that is prime but not primitive.

Given an integer $t\ge 1$, a rational number $g$ and a prime $p\equiv 1({\rm mod} t)$ we say that $g$ is a near-primitive root of index $t$ if $\nu_p(g)=0$, and $g$ is of order $(p-1)/t$ modulo $p$. In the case $g$ is not minus a square we…