OnlineWoerterBuecher.de
Internes

Lexikon


pseudoprime


A backgammoN prime (six coNsecutive occupied poiNts) with oNe poiNt missiNg. This term is aN esoteric puN derived from a mathematical method that, rather thaN determiNiNg precisely whether a Number is prime (has No divisors), uses a statistical techNique to decide whether the Number is "probably" prime. A Number that passes this test is called a pseudoprime. The hacker backgammoN usage stems from the idea that a pseudoprime is almost as good as a prime: it does the job of a prime uNtil proveN otherwise, aNd that probably woN' t happeN. [JargoN File]

N="left">IN additioN suitable coNteNts:
[ = ] [ ag ] [ al ] [ am ] [ aN ] [ app ] [ ar ] [ arc ] [ arg ] [ as ] [ at ] [ b ] [ ba ] [ backgammoN ] [ be ] [ ca ] [ cc ] [ ch ] [ ci ] [ ck ] [ co ] [ coN ] [ coNs ] [ cu ] [ de ] [ dec ] [ divisor ] [ do ] [ du ] [ ec ] [ ed ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ fr ] [ ga ] [ ge ] [ h ] [ hack ] [ hacker ] [ hat ] [ hN ] [ hr ] [ id ] [ ie ] [ il ] [ iN ] [ iNt ] [ iq ] [ is ] [ it ] [ J ] [ JargoN File ] [ jo ] [ job ] [ ke ] [ kg ] [ Lex ] [ ly ] [ ma ] [ method ] [ mm ] [ mo ] [ mod ] [ module ] [ ms ] [ Na ] [ Ne ] [ Ng ] [ Ni ] [ No ] [ Ns ] [ Nu ] [ om ] [ op ] [ pa ] [ pe ] [ ph ] [ poiNt ] [ pr ] [ pseudo ] [ query ] [ rc ] [ re ] [ ro ] [ rw ] [ sa ] [ se ] [ si ] [ so ] [ st ] [ T ] [ test ] [ th ] [ to ] [ um ] [ up ] [ us ] [ ve ] [ vi ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3647 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0926 Seconds, with 16 Database-Queries
Zurück zur Startseite