###### tags: `Number Theory` `NT01` # L03.5 Prime Distribution and Weekness of Symmetrical Key --- ## Last Week <font size = 6> - Primes, FTA, Factorisation </font> --- ## This week <font size = 6> - Prime Distritution - Idea of mod + permutation </font> --- 1. Magic Primes ![picture](https://drive.google.com/uc?export=view&id=1E4nQnPfRV4iU9R-Z3b6AQcUNB5brYycY) ---- 1.1 How many are there? <font size = 5>FTA tells us that Primes are **cornerstones**. </font> <font size = 4> So how many such cornerstones there in the Natual Number's Regime? The answer is infinitely many! **Idea of proof (from Euclid again):** if we have finite primes, says, $p_1$ and $p_2$, then, multiply them together, we get $p_1 p_2$, which is a composite number. But how about $1+p_1 p_2$? Is it a prime or composite? ---- 1.2 Number of Primes given a range <font size = 5>Even though we do not know exactly how many primes there, we know approximately, number of primes given a range. </font> <font size = 4> $$\pi(n) \approx \frac{n}{ln(n)}$$ Where n is a large number refers to the range, e.g. within 100000, etc. $\pi(n)$ refers to the approx number of primes given n as upperbound. $ln(n)$ refers to the natural logarithms of n. </font> ---
{"metaMigratedAt":"2023-06-17T05:41:07.908Z","metaMigratedFrom":"YAML","title":"NT01_L03.5","breaks":true,"description":"Prime Distribution.","slideOptions":"{\"theme\":\"beige\"}","contributors":"[{\"id\":\"d8479402-2b3f-4751-92f6-b67f55f4b94f\",\"add\":5055,\"del\":3621}]"}
    174 views