Learn Java Programming - BigInteger .isProbablePrime() Part 3 Multithreading Tutorial
In this tutorial I am going to build on concepts from the Part 2 Tutorial. I am going to be using the Thread class in this tutorial to greatly reduce the amount of time it takes to find prime factors of a large composite number. Consider the number 10,000. It is the product of 100 * 100, or the square root of 10,000 is 100 - pretty simple stuff. Now let's take the composite number 9991 and try to come up with a strategy on how to determine what two prime numbers are the factors of this number. Following the same logic from part2, we simply start dividing 9991 by prime numbers starting with 2,3,5,7, etc. Eventually we will hit 97 and 9991 will divide out evenly with 103. This takes quite a few calculations to find the prime factors.
En esta página del sitio puede ver el video en línea Learn Java Programming - BigInteger .isProbablePrime() Part 3 Multithreading Tutorial de Duración hora minuto segunda en buena calidad , que subió el usuario Daniel Ross 02 mayo 2017, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 595 veces y le gustó 10 a los espectadores. Disfruta viendo!
