Adleman–Pomerance–Rumely primality test
id:
adleman-pomerance-rumely-primality-test-309-14519353
title:
Adleman–Pomerance–Rumely primality test
text:
In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Unlike other, more efficient algorithms for this purpose, it avoids the use of random numbers, so it is a deterministic primality test. It is named after its discoverers, Leonard Adleman, Carl Pomerance, and Robert Rumely. The test involves arithmetic in cyclotomic fields. It was later improved by Henri Cohen and Hendrik Willem Lenstra, commonly referred to as AP
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Adleman%E2%80%93Pomerance%E2%80%93Rumely_primality_test
date created:
date modified:
2024-03-27T17:37:42Z
main entity:
{"identifier":"Q4683276","url":"https://www.wikidata.org/entity/Q4683276"}
image:
fields total:
13
integrity:
13