English
Related papers

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

200 papers

We consider the problem of whether or not certain mock theta functions vanish at the roots of unity with an odd order. We prove for any such function $f(q)$ that there exists a constant $C>0$ such that for any odd integer $n>C$ the function…

Number Theory · Mathematics 2021-06-25 Mohamed El Bachraoui

This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…

General Mathematics · Mathematics 2020-10-02 Christopher Thron , Jordan T. Barry

We present several elementary closed-forms that express a non-trivial divisor for every composite integer $n > 1$. Each closed-form consists of a fixed number of elementary arithmetic operations drawn from the set: addition, subtraction,…

Number Theory · Mathematics 2025-11-03 Mihai Prunescu , Joseph M. Shunia

This paper provides two characterizations of the primitive roots of unity in quadratic cyclotomic extensions over arbitrary fields. Firstly, we introduce a mapping from $\mathbb{N}$ to $\mathbb{N}$ crucial for describing these roots,…

Number Theory · Mathematics 2024-07-30 Sophie Marques , Elizabeth Mrema

We prove lower bounds of the form $\gg N/(\log N)^{3/2}$ for the number of primes up to $N$ primitively represented by a shifted positive definite integral binary quadratic form, and under the additional condition that primes are from an…

Number Theory · Mathematics 2025-04-30 Elena Fuchs , Catherine Hsu , James Rickards , Damaris Schindler , Katherine E. Stange

Primitive recursion is a mature, well-understood topic in the theory and practice of programming. Yet its dual, primitive corecursion, is underappreciated and still seen as exotic. We aim to put them both on equal footing by giving a…

Programming Languages · Computer Science 2021-03-16 Paul Downen , Zena M. Ariola

Following a remark of Lawvere, we explicitly exhibit a particularly elementary bijection between the set T of finite binary trees and the set T^7 of seven-tuples of such trees. "Particularly elementary" means that the application of the…

Logic · Mathematics 2019-08-27 Andreas Blass

This paper is continuation of the paper "Primitive roots in quadratic field". We consider an analogue of Artin's primitive root conjecture for algebraic numbers which is not a unit in real quadratic fields. Given such an algebraic number,…

Number Theory · Mathematics 2007-05-23 Joseph Cohen

Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…

Number Theory · Mathematics 2020-12-29 Aram Bingham

Previous analyses of Laguerre's method have provided results on the convergence and properties of this popular method when applied to the polynomials $p_n(z)=z^n-1$, $n\in\mathbb{N}$. While these analyses appear to provide a fairly complete…

Numerical Analysis · Mathematics 2014-05-06 Pavel Bělík , HeeChan Kang , Andrew Walsh , Emma Winegar

Artin's Conjecture on Primitive Roots states that a non-square nonunit integer $a$ is a primitive root modulo $p$ for the positive proportion of $p$. This conjecture remains open, but on average, there are many results due to P. J.…

Number Theory · Mathematics 2022-02-28 Sungjin Kim

This paper is a continuation of our previous works where we study maps from $X_0(N)$, $N \ge 1$, into $\mathbb P^2$ constructed via modular forms of the same weight and criteria that such a map is birational (see [12]). In the present paper…

Number Theory · Mathematics 2020-06-19 Iva Kodrnja , Goran Muić

Let $p\geq 2$ be a large prime, and let $N\gg ( \log p)^{1+\varepsilon}$. This note proves the existence of primitive roots in the short interval $[M,M+N]$, where $M \geq 2$ is a fixed number, and $ \varepsilon>0$ is a small number. In…

General Mathematics · Mathematics 2020-05-27 N. A. Carella

The Newton-Raphson (N-R) method is useful to find the roots of a polynomial of degree n. However, this method is limited since it diverges for the case in which polynomials only have complex roots if a real initial condition is taken. In…

Numerical Analysis · Mathematics 2024-04-25 A. Torres-Hernandez , F. Brambila-Paz

The first purpose of our paper is to show how Hooley's celebrated method leading to his conditional proof of the Artin conjecture on primitive roots can be combined with the Hardy-Littlewood circle method. We do so by studying the number of…

Number Theory · Mathematics 2020-05-19 Christopher Frei , Peter Koymans , Efthymios Sofos

Motivated by questions in number theory, Myerson asked how small the sum of 5 complex nth roots of unity can be. We obtain a uniform bound of O(n^{-4/3}) by perturbing the vertices of a regular pentagon, improving to O(n^{-7/3}) infinitely…

Number Theory · Mathematics 2023-02-17 Ben Barber

Let C be some class of objects equipped with a set of simplifying moves. When we apply these to a given object M in C as long as possible, we get a root of M. Our main result is that under certain conditions the root of any object exists…

Geometric Topology · Mathematics 2009-04-10 Cynthia Hog-Angeloni , Sergei Matveev

Let F be the function field of a curve over a p-adic field. Let D/F be a central division algebra of prime exponent $\ell$ which is different from p. Assume that F contains a primitive ${\ell}^2$-th root of unity. Then the group…

Rings and Algebras · Mathematics 2018-08-29 Nivedita Bhaskhar

A nonempty subset A of {1,2,...,n} is called primitive if gcd(A)=1. Let f(n) and f_k(n) denote, respectively, the number of primitive subsets and the number of primitive subsets of cardinality k of {1,2,...,n}. Recursion formulas and…

Number Theory · Mathematics 2007-09-17 Melvyn B. Nathanson

Given a subset of $\mathbb C$ containing $x,y$, one can add $x + y,\,x - y,\,xy$ or (when $y\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\{1\}$ a set containing…

Number Theory · Mathematics 2018-03-19 Eugene Kogan