proof of prime numbers theory ??
Attachments:
Answers
Answered by
0
Answer:
ok bro The prime number theorem provides a way to approximate the number of primes less than or equal to a given number n. This value is called π(n), where π is the “prime counting function.” For example, π(10) = 4 since there are four primes less than or equal to 10 (2, 3, 5 and 7).
Step-by-step explanation:
Mark me brainlist I need support pls
Answered by
1
Answer:
oye mai aaa gye.
sorry for yesterday yrr
Similar questions