pure - (simple logic)

2009-09-16 6:59 am
1a. using the method of proof by contradiction, show that if k is a natural number and k^2 is divisible by 3, then k is divisible by3

1b. prove that if n is a natural number made up of 2002 digits, 2001 of them being ’1’and one of them being’0’, then √n is not an integer

2. prove that if x is rational and y is irrational then x+y is irrational

3. can we divide the positive integers 1,2,3,...,33 into 11 groups of 3 numbers such that among each group, one of the nembers is the sum of the other two members? explain.

回答 (2)

2009-09-16 7:50 am
✔ 最佳答案
1a. Let's assume k is not divisible by 3. Then either k + 1 or k - 1 is divisible by 3.
If k + 1 is divisible by 3, then k + 1 = 3N where N is a natural number.
k = 3N - 1
k2 = 9N2 - 6N + 1 = 3(3N2 - 2N) - 1 => k2 is not divisible by 3 ... (1)
Similarly if k - 1 is divisible by 3, then k - 1 = 3M where M is a natural number
k = 3M + 1
k2 = 9M2 + 6M + 1 = 3(3M2 + 2M) + 1 => k2 is not divisible by 3 ... (2)
(1) and (2) together implies a contradiction of the assumption. Therefore k is divisible by 3.
1b. Let's assume that k = √n is a natural number.
k2 = n is divisible by 3 since the sum of all the digits of n is 2001, and 2001 = 3 x 667
Following 1a, k is also divisible by 3.
Let's put k = 3N where N is a natural number, then k2 = 9N2 => k2 is divisible by 9. However since the sum of all the digits of n is not divisible by 9, n is not divisible by 9. This is a contradiction. Hence n is not a natural number
2. Since x is rational, x = p/q where p and q are integers
Let assume x + y is rational, i.e. x + y = h/k where h and k are integers
y = x + y - x
y = h/k - p/q
y = (qh - pk) / qk which implies that y is rational => contradiction.
So the assumption x + y is rational is wrong and x + y is irrational
3. Let's assume such groupings are possible.
For each if such groups, let's denote the three numbers as ai, bi and ai + bi
So the sum of all these groups are ∑(i=1 to 11)(ai + bi + ai + bi)
= ∑(i=1 to 11)2(ai + bi) is even
Now 1 + 2 + 3 + ... + 33 = (33)(33 + 1)/2 = 561 is odd, which is a contradiction. Hence such groupings are not possible.
2009-09-16 7:33 am
1(a) proof by contradiction. If k is not divisible by3. Then k=3n+1 or 3n+2. We can see that (3n+1)^2=9n^2+6n+1 and (3n+2)^2=9n^2+12n+4 which are not divisible by3. A contradiction
(b) if √n is an integer k, then k^2=n. We know that n is divisible by 3=>k^2 is divisible by 3=>k is divisible by 3. Let k=3m. Then n=9m^2 which indicates that n is divisible by 9, which is a contradiction.
2 If x+y is rational
Then (x+y)-x should also be rational which is a contradiction since y is irrational
3 If this can be done then 1+2+3+...+33=33*34/2=561 is even, a contradiction.


收錄日期: 2021-04-23 23:22:51
原文連結 [永久失效]:
https://hk.answers.yahoo.com/question/index?qid=20090915000051KK02345

檢視 Wayback Machine 備份