Prime Divisors(Erdös-Kac)
陳韋達先生中央大學數學系 上午 10:00–12:00 鴻經館 328 室摘要：
In this talk, I would like to prove that an integer picked at random from {1,...,n} has about X prime divisors where X is the normal distribution with mean loglog n and variance loglog n. This is a problem from number theory but can be characterized in the form of Central Limit Theorem. The main ideal is apply Lindeberg-Feller Theorem and a well-known result in number theory. The material is basically coveredby the book, “Probability:Theory and Examples”,of Durrett.