top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
17 lectures on fermat numbers : from number theory to geometry / Michal Krizek, Florian Luca, Lawrence Somer ; with a foreword by Alena Solcova
17 lectures on fermat numbers : from number theory to geometry / Michal Krizek, Florian Luca, Lawrence Somer ; with a foreword by Alena Solcova
Autore Krizek, Michal
Pubbl/distr/stampa New York, : Springer, 2001
Descrizione fisica XXIV, 257 p. : ill. ; 24 cm.
Altri autori (Persone) Luca, Florian
Somer, Lawrence
Soggetto topico 11Axx - Elementary number theory [MSC 2020]
11Dxx - Diophantine equations [MSC 2020]
11N05 - Distribution of primes [MSC 2020]
11A41 - Primes [MSC 2020]
ISBN 03-87953-32-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-SUN0060414
Krizek, Michal  
New York, : Springer, 2001
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
17 lectures on fermat numbers : from number theory to geometry / Michal Krizek, Florian Luca, Lawrence Somer ; with a foreword by Alena Solcova
17 lectures on fermat numbers : from number theory to geometry / Michal Krizek, Florian Luca, Lawrence Somer ; with a foreword by Alena Solcova
Autore Krizek, Michal
Pubbl/distr/stampa New York, : Springer, 2001
Descrizione fisica XXIV, 257 p. : ill. ; 24 cm
Altri autori (Persone) Luca, Florian
Somer, Lawrence
Soggetto topico 11Axx - Elementary number theory [MSC 2020]
11Dxx - Diophantine equations [MSC 2020]
11N05 - Distribution of primes [MSC 2020]
11A41 - Primes [MSC 2020]
ISBN 03-87953-32-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-VAN0060414
Krizek, Michal  
New York, : Springer, 2001
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
17 lectures on Fermat numbers : from number theory to geometry / Michal Křížek, Florian Luca, Lawrence Somer ; with a foreword by Alena Šolcová
17 lectures on Fermat numbers : from number theory to geometry / Michal Křížek, Florian Luca, Lawrence Somer ; with a foreword by Alena Šolcová
Autore Křížek, Michal
Pubbl/distr/stampa New York, : Springer, 2001
Descrizione fisica XXIV, 257 p. : ill. ; 24 cm
Altri autori (Persone) Luca, Florian
Somer, Lawrence E.
Soggetto topico 11A41 - Primes [MSC 2020]
11Axx - Elementary number theory [MSC 2020]
11Dxx - Diophantine equations [MSC 2020]
11N05 - Distribution of primes [MSC 2020]
ISBN 03-87953-32-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-VAN00060414
Křížek, Michal  
New York, : Springer, 2001
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
Algebraic, Number Theoretic, and Topological Aspects of Ring Theory / Jean-Luc Chabert ... [et al.] editors
Algebraic, Number Theoretic, and Topological Aspects of Ring Theory / Jean-Luc Chabert ... [et al.] editors
Pubbl/distr/stampa Cham, : Springer, 2023
Descrizione fisica x, 474 p. : ill. ; 24 cm
Soggetto topico 00B25 - Proceedings of conferences of miscellaneous specific interest [MSC 2020]
11A41 - Primes [MSC 2020]
13-XX - Commutative algebra [MSC 2020]
13Axx - General commutative ring theory [MSC 2020]
13Fxx - Arithmetic rings and other special commutative rings [MSC 2020]
Soggetto non controllato Bhargava Generalized Factorials
Capacity Theory
Commutative Rings
Conference Rings Polynomials
Integer-valued polynomials
Linear algebra over rings
Module theory
Multiplicative ideal theory
Non-commutative rings
Polya fields
Polynomial functions
Ring theory
Rings and polynomials
Topological methods ring theory
Zariski-Riemann spaces
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-VAN00278705
Cham, : Springer, 2023
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
Computational Algebraic Number Theory / Michael E. Pohst
Computational Algebraic Number Theory / Michael E. Pohst
Autore Pohst, Michael E.
Pubbl/distr/stampa Basel, : Springer, 1993
Descrizione fisica 88 p. : ill. ; 24 cm
Soggetto topico 11-XX - Number theory [MSC 2020]
11A41 - Primes [MSC 2020]
11H06 - Lattices and convex bodies (number-theoretic aspects) [MSC 2020]
11R27 - Units and factorization [MSC 2020]
11R29 - Class numbers, class groups, discriminants [MSC 2020]
11Rxx - Algebraic number theory: global fields [MSC 2020]
11Y40 - Algebraic number theory computations [MSC 2020]
Soggetto non controllato Algebra
Coding Theory
Cryptography
Finite fields
Geometry
Mathematics
Number theory
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-VAN00290151
Pohst, Michael E.  
Basel, : Springer, 1993
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
Factorization and primality testing / David M. Bressoud
Factorization and primality testing / David M. Bressoud
Autore Bressoud, David M.
Pubbl/distr/stampa New York, : Springer, 1989
Descrizione fisica XIII, 237 p. ; 24 cm.
Soggetto topico 11-XX - Number theory [MSC 2020]
11Axx - Elementary number theory [MSC 2020]
94A60 - Cryptography [MSC 2020]
68W30 - Symbolic computation and algebraic computation [MSC 2020]
11A41 - Primes [MSC 2020]
11Y11 - Primality [MSC 2020]
11Y05 - Factorization [MSC 2020]
ISBN 978-03-87970-40-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-SUN0029364
Bressoud, David M.  
New York, : Springer, 1989
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
Factorization and primality testing / David M. Bressoud
Factorization and primality testing / David M. Bressoud
Autore Bressoud, David M.
Pubbl/distr/stampa New York, : Springer, 1989
Descrizione fisica XIII, 237 p. ; 24 cm
Soggetto topico 11-XX - Number theory [MSC 2020]
11Axx - Elementary number theory [MSC 2020]
94A60 - Cryptography [MSC 2020]
68W30 - Symbolic computation and algebraic computation [MSC 2020]
11A41 - Primes [MSC 2020]
11Y11 - Primality [MSC 2020]
11Y05 - Factorization [MSC 2020]
Soggetto non controllato Binomials
Elliptic curves
Euclidean Algorithms
Mersenne prime
Prime numbers
Quadratic forms
ISBN 978-03-87970-40-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-VAN0029364
Bressoud, David M.  
New York, : Springer, 1989
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
Factorization and Primality Testing / David M. Bressoud
Factorization and Primality Testing / David M. Bressoud
Autore Bressoud, David M.
Pubbl/distr/stampa New York, : Springer, 1989
Descrizione fisica xiii, 237 p. ; 24 cm
Soggetto topico 11-XX - Number theory [MSC 2020]
11Axx - Elementary number theory [MSC 2020]
94A60 - Cryptography [MSC 2020]
68W30 - Symbolic computation and algebraic computation [MSC 2020]
11A41 - Primes [MSC 2020]
11Y11 - Primality [MSC 2020]
11Y05 - Factorization [MSC 2020]
Soggetto non controllato Binomials
Elliptic curves
Euclidean Algorithms
Mersenne prime
Prime numbers
Quadratic forms
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNICAMPANIA-VAN0269191
Bressoud, David M.  
New York, : Springer, 1989
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
Factorization and primality testing / David M. Bressoud
Factorization and primality testing / David M. Bressoud
Autore Bressoud, David M.
Pubbl/distr/stampa New York, : Springer, 1989
Descrizione fisica XIII, 237 p. ; 24 cm
Soggetto topico 11-XX - Number theory [MSC 2020]
11A41 - Primes [MSC 2020]
11Axx - Elementary number theory [MSC 2020]
11Y05 - Factorization [MSC 2020]
11Y11 - Primality [MSC 2020]
68W30 - Symbolic computation and algebraic computation [MSC 2020]
94A60 - Cryptography [MSC 2020]
Soggetto non controllato Binomials
Elliptic Curves
Euclidean Algorithms
Mersenne Prime Number
Prime numbers
Quadratic forms
ISBN 978-03-87970-40-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Titolo uniforme
Record Nr. UNICAMPANIA-VAN00029364
Bressoud, David M.  
New York, : Springer, 1989
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui
Factorization and Primality Testing / David M. Bressoud
Factorization and Primality Testing / David M. Bressoud
Autore Bressoud, David M.
Pubbl/distr/stampa New York, : Springer, 1989
Descrizione fisica xiii, 237 p. ; 24 cm
Soggetto topico 11-XX - Number theory [MSC 2020]
11A41 - Primes [MSC 2020]
11Axx - Elementary number theory [MSC 2020]
11Y05 - Factorization [MSC 2020]
11Y11 - Primality [MSC 2020]
68W30 - Symbolic computation and algebraic computation [MSC 2020]
94A60 - Cryptography [MSC 2020]
Soggetto non controllato Binomials
Elliptic Curves
Euclidean Algorithms
Mersenne Prime Number
Prime numbers
Quadratic forms
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto "About binomial theorems I'm teeming with a lot of news, With many cheerful facts about the square on the hypotenuse. " - William S. Gilbert (The Pirates of Penzance, Act I) The question of divisibility is arguably the oldest problem in mathematics. Ancient peoples observed the cycles of nature: the day, the lunar month, and the year, and assumed that each divided evenly into the next. Civilizations as separate as the Egyptians of ten thousand years ago and the Central American Mayans adopted a month of thirty days and a year of twelve months. Even when the inaccuracy of a 360-day year became apparent, they preferred to retain it and add five intercalary days. The number 360 retains its psychological appeal today because it is divisible by many small integers. The technical term for such a number reflects this appeal. It is called a "smooth" number. At the other extreme are those integers with no smaller divisors other than 1, integers which might be called the indivisibles. The mystic qualities of numbers such as 7 and 13 derive in no small part from the fact that they are indivisibles. The ancient Greeks realized that every integer could be written uniquely as a product of indivisibles larger than 1, what we appropriately call prime numbers. To know the decomposition of an integer into a product of primes is to have a complete description of all of its divisors.
Titolo uniforme
Record Nr. UNICAMPANIA-VAN00269191
Bressoud, David M.  
New York, : Springer, 1989
Materiale a stampa
Lo trovi qui: Univ. Vanvitelli
Opac: Controlla la disponibilità qui