Return to Video

Density Of Primes Solution - Applied Cryptography

  • 0:00 - 0:03
    So the answer is we only need about 115 guesses.
  • 0:03 - 0:07
    So that shouldn't take too long, as long as there's a quick way to tell if a number is prime.
  • 0:07 - 0:13
    And to compute that result, we computed the log of 10 to the 100.
  • 0:13 - 0:15
    You could do that in Python by using the math library
  • 0:15 - 0:21
    and computing the log of 10 to the power of 100 where the base of the log is math.e--
  • 0:21 - 0:23
    that's the constant for the natural log.
  • 0:23 - 0:26
    That would give you a result about 230.
  • 0:26 - 0:30
    We'll divide that by 2 to get the expected number of guesses we need.
Title:
Density Of Primes Solution - Applied Cryptography
Video Language:
English
Team:
Udacity
Project:
CS387 - Applied Cryptography
Duration:
0:31
Udacity Robot edited English subtitles for Density Of Primes Solution - Applied Cryptography
Gundega added a translation

English subtitles

Revisions Compare revisions