Roots of unity and nullity modulo $n$

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ROOTS OF UNITY AND NULLITY MODULO n

For a fixed positive integer , we consider the function of n that counts the number of elements of order in Zn. We show that the average growth rate of this function is C (logn) d( )−1 for an explicitly given constant C , where d( ) is the number of divisors of . From this we conclude that the average growth rate of the number of primitive Dirichlet characters modulo n of order is (d( )− 1)C (l...

متن کامل

Square Roots Modulo p

The algorithm of Tonelli and Shanks for computing square roots modulo a prime number is the most used, and probably the fastest among the known algorithms when averaged over all prime numbers. However, for some particular prime numbers, there are other algorithms which are considerably faster. In this paper we compare the algorithm of Tonelli and Shanks with an algorithm based in quadratic fiel...

متن کامل

News about Roots of Unity

This text was originally intended for non-mathematicians; during its preparation B. Mazur and A. Wiles announced the solution of the ’Main Conjecture’ in the theory of cyclotomic fields. It seemed appropriate to us to try to give an explanation of what this sensational discovery is all about.

متن کامل

Roots of unity in orders

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in the group of roots of unity can be solved in polynomial time. As an auxiliary result, we solve the discrete logarithm problem for certain unit groups in finite...

متن کامل

Cohen–lenstra Heuristic and Roots of Unity

We report on computational results indicating that the well-known Cohen–Lenstra–Martinet heuristic for class groups of number fields may fail in many situations. In particular, the underlying assumption that the frequency of groups is governed essentially by the reciprocal of the order of their automorphism groups, does not seem to be valid in those cases. The phenomenon is related to the prese...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2010

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-10-10341-4