Trace:
wiki:donuts:winter2013
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
|
wiki:donuts:winter2013 [2013/11/08 21:22] jmb438 created |
wiki:donuts:winter2013 [2014/04/30 12:12] (current) jmb438 |
||
|---|---|---|---|
| Line 15: | Line 15: | ||
| ===== Semiprime Numbers ===== | ===== Semiprime Numbers ===== | ||
| - | "Semiprimes are highly useful in the area of cryptography and number theory, most notably in public key cryptography, where they are used by RSA and pseudorandom number generators such as Blum Blum Shub. These methods rely on the fact that finding two large primes and multiplying them together (resulting in a semiprime) is computationally simple, whereas finding the original factors appears to be difficult. In the RSA Factoring Challenge, RSA Security offered prizes for the factoring of specific large semiprimes and several prizes were awarded. The most recent such challenge closed in 2007." (http://en.wikipedia.org/wiki/Semiprime#Applications) | + | "Semiprimes are highly useful in the area of cryptography and number theory, most notably in public key cryptography, where they are used by RSA and pseudorandom number generators such as Blum Blum Shub. These methods rely on the fact that finding two large primes and multiplying them together (resulting in a semiprime) is computationally simple, whereas finding the original factors appears to be difficult. In the RSA Factoring Challenge, RSA Security offered prizes for the factoring of specific large semiprimes and several prizes were awarded. The most recent such challenge closed in 2007." ([[http://en.wikipedia.org/wiki/Semiprime#Applications|Semiprime on Wikipedia]]) |
| For a simple example, find the prime factorization of the semiprime number 391. ((Dr. Warnick, Mar. 13, 2013)) | For a simple example, find the prime factorization of the semiprime number 391. ((Dr. Warnick, Mar. 13, 2013)) | ||
| Line 31: | Line 31: | ||
| ===== Stick Equation ===== | ===== Stick Equation ===== | ||
| - | Treating each line as a matchstick that can be picked up and moved, make the following equation equal to 4 by moving only a single stick. ((Brian Jeffs Apr. 10, 2013)) | + | Treating each line as a matchstick that can be picked up and moved, make the following equation equal to 4 by moving only a single stick. ((Dr. Jeffs Apr. 10, 2013)) |
| | + || + ||| + |||| | | + || + ||| + |||| | ||
| Line 42: | Line 42: | ||
| [[wiki:donuts:digits|answer]] | [[wiki:donuts:digits|answer]] | ||
| + | |||
| + | ===== Questions Asked ===== | ||
| + | | Dr. Warnick | 1 | | ||
| + | | Jay Brady | 1 | | ||
| + | | Richard Black | 1 | | ||
| + | | Dr. Jeffs | 2 | | ||
| + | | Junming Diao | 2 | | ||
| + | |||
| + | |||
| + | |||
| + | |||
| + | |||
wiki/donuts/winter2013.1383970932.txt.gz ยท Last modified: 2013/11/08 21:22 by jmb438