Primality Test
CHF 49.30
Auf Lager
SKU
VPLSJCFDLQA
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Di., 28.10.2025 und Mi., 29.10.2025
Details
High Quality Content by WIKIPEDIA articles! A primality test is an algorithm for determining whether an input number is prime. Amongst other fields of mathematics, it is used for cryptography. The difference between this and integer factorization is that a primality test doesn't necessarily give prime factors (it only states whether the input number is prime or not), while integer factorization does. As of 2009[update], factorization is a computationally hard problem, whereas primality testing is comparatively easy (its running time is polynomial). Some primality tests prove that a number is prime, while others prove that a number is composite. Therefore we might call the latter compositeness tests instead of primality tests.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786130346188
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Größe H220mm x B150mm x T7mm
- Jahr 2010
- EAN 9786130346188
- Format Fachbuch
- ISBN 978-613-0-34618-8
- Titel Primality Test
- Untertitel Algorithm, Prime Number, Mathematics, Cryptography, Integer Factorization, Prime Factor, Analysis of Algorithms, Polynomial Time, Composite Number, Divisor, Recursion
- Gewicht 189g
- Herausgeber Betascript Publishers
- Anzahl Seiten 116
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
