Betascript Publishers

Primality Test

Name: Primality Test
Brand: Betascript Publishers
SKU: 69aba6dc64f40c5da11192bb1cf686bc

1/1

Bol

Prijzen vanaf

47,27

Uitgelicht

	47,27	Naar shop
	47,27	Naar shop
	156,00	Naar shop
VERGELIJK ALLE AANBIEDERS (3)

Beschrijving

Bol Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.

Lees meer

Vergelijk aanbieders (3)

Sorteren op:

€ 47,27 Gratis verzending

€ 156,00 Gratis verzending

Beschrijving (1)

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.

Lees meer