No label defined (Q4023162)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 107574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 107574 |
Statements
23 January 1993
0 references
cyclotomic polynomials
0 references
cyclotomic numbers
0 references
table of prime factorization
0 references
0.8176934719085693
0 references
0.7991626262664795
0 references
0.7949547171592712
0 references
Authors' preface: This book is a continuation of our former books [Part I, Sophia Kokyuroku in Mathematics 26 (1987; Zbl 0632.10001) and Part II (with \textit{M. Saito}), Sophia Kokyuroku in Mathematics 28 (1989; Zbl 0661.10001)]. The cyclotomic polynomials \(\Phi_ n(x)\) are defined recursively by the following factorization: \(\Phi_ 1(x)=x-1\), \(x^ m- 1=\prod_{n| m} \Phi_ n(x)\). For integers \(n\) and \(x\), the numbers \(N=\Phi_ n(x)\) are called cyclotomic numbers. (In our tables, we denote \(\Phi_ n(x)\) by \(M(n,x)\)). The objective of our project is to factor the cyclotomic numbers in the range of \(2\leq n\leq 1000\) and in particular to find prime cyclotomic numbers. We published the table of prime factorization of cyclotomic numbers for \(n\) with \(\varphi(n)=16\) and 18 in Part I and for \(n\) with \(\varphi(n)=20\) and 22 in Part II. In the present volume, we publish the table for \(n\) with \(\varphi(n)=24\) and 28; that is, \[ n=35,39,45,52,56,70,72,78,84,90 \quad \text{Chapter }1, \qquad n=29,58 \quad \text{Chapter }2. \] Here we find the prime factorization of the cyclotomic numbers as large as of 84 digits, while the largest numbers were of 48 digits in Part I and of 66 digits in Part II. This progress has become possible partly because of the technological improvement of personal computers but mainly due to the development of new algorithms of prime factorization. Chapter 3 is an article (in Japanese) by Yuji Kida on two recent methods of factorization, namely PPMPQS and number field sieve. Chapter 4 is an article by \textit{Mitsuo Morimoto} ``Factorization and primality test of cyclotomic numbers'' (in English), which describes the background of our project. The list of prime cyclotomic numbers of more than 1000 digits is given at the end of the chapter.
0 references