From 7fb1cccfeae4349a8cb36da07e57e85a5e9d5276 Mon Sep 17 00:00:00 2001 From: buttonwild <33722083+buttonwild@users.noreply.github.com> Date: Sun, 5 May 2024 02:31:30 +0800 Subject: [PATCH] Tran:#60-2 Proofreading the second lecture on translation --- Languages/en/02_Prime/readme.md | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/Languages/en/02_Prime/readme.md b/Languages/en/02_Prime/readme.md index 564faa5..5f015b2 100644 --- a/Languages/en/02_Prime/readme.md +++ b/Languages/en/02_Prime/readme.md @@ -7,8 +7,7 @@ tags: --- # WTF zk Tutorial Lesson 2: Prime Number Basics - -Welcome to the second tutorial of the WTF zk series! In this tutorial, we will explore the basics of prime numbers. Prime numbers play a crucial role in cryptography, making it essential to understand them for learning zero-knowledge proofs. +Welcome to the second lesson of the WTF zk tutorial series! In this tutorial, we will explore the basics of prime numbers. Prime numbers play a crucial role in cryptography, making it essential to understand them for learning zero-knowledge proofs. ## 1. Definition of Prime Numbers @@ -30,7 +29,7 @@ $$ Here, 2, 3, and 7 are prime numbers, and this factorization is unique. -Prime number theorem: The number of prime numbers less than or equal to N is approximately $N/\ln{N}$, and there are infinitely many prime numbers. +Prime Number Theorem: The number of prime numbers less than or equal to N is approximately $N/\ln{N}$, and there are infinitely many prime numbers. Proof: