Re: Some question in prime number!
- From: Cooper <cooper0040@xxxxxxxxx>
- Date: Fri, 29 Feb 2008 19:03:40 -0800 (PST)
On 3월1일, 오전8시22분, quasi <qu...@xxxxxxxx> wrote:
On Fri, 29 Feb 2008 15:08:50 EST, Usher73 <Ushe...@xxxxxxxxx> wrote:
Hi!
I want to ask two question about prime numbers.
1. Show that if n>6, then n can be expressed as a sum
of distinct
primes.
**At first, I tried the induction method.
So, assume that it is true for all k <n.
Next choose the largest prime among less than n and
denote it P.
Then 2P should be greater than n by bertrand
postulate and P is the
largest prime number.
Write n=P+(n-P). If n-P >6, by induction hypothesis
we express it as a
sum of distinct primes and since n-P<P, P does not
appear in the
expression.
I cannot treat the case n-P<=6. Actually, it is
enough to consider n-
P=1,4,6.
2.Deduce that Prod_{primes <= x} (1-1/p) = (c / ln x)
+ O(1/(ln x)^2)
for some constant c.
How to solve these two problems?
11 > 6
11 cannot be written as a sum of two distinct primes
But 11 is the sum of 3 distinct primes.
The OP didn't say that it had to be only two distinct primes,
quasi- 따온 텍스트 숨기기 -
- 따온 텍스트 보기 -
11 is itself a prime.
.
- References:
- Re: Some question in prime number!
- From: quasi
- Re: Some question in prime number!
- Prev by Date: Re: Some question in prime number!
- Next by Date: Re: linear operator as dynamical system
- Previous by thread: Re: Some question in prime number!
- Next by thread: Re: Some question in prime number!
- Index(es):
Relevant Pages
|
Loading