Roviury

名：Roviury
出生日期：1993年10月31日(萬聖節快樂^^)
興趣：算術,電腦,地理

2010/06/xx

js Selector "qSA" successful made host on google code

2008/06/19

My discover-Property of Prime (it's wrong)

Let p,q be prime.
∵p-q=1 , p>5 and q>3
∴p-1=0(mod 6) and q+1=0(mod 6)

2009/03/17

Proof of Goldbach conjecture(Not sure, only for reference) (it's wrong)

by Wiki user User:Roviury

Proof of weak Goldbach conjecture (it's wrong)

ps.ALL prime no. must be formed "2k+1"(k>=1,where k is an integer)
(
2k
2k+1
2k+2=2(k+1)
2k+3=2(k+1)+1
...
)

pf:
Let a and b are the 2 prime no., p and q are >=1
a=2p+1>=3
b=2q+1>=3
a+b=2p+2q+2
a+b=2(p+q+1)
i.e. a+b=2n,where n is an integer
(a+b>=6)

it cannot use in "a+b=4"
but 4 also can be formed 2+2

Proof of strong Goldbach conjecture

ps.ALL prime no. must be formed "2k+1"(k>=1,where k is an integer)
(
2k
2k+1
2k+2=2(k+1)
2k+3=2(k+1)+1
...
)

pf:
Let a, b and c are the 3 prime no.,p, q and r are >=1
a=2p+1>=3
b=2q+1>=3
c=2r+1>=3
a+b+c=2p+2q+2r+3
a+b+c=2(p+q+r+1)+1
i.e. a+b=2n+1,where n is an integer
(a+b+c>=9)

字詞轉換測試

共用,共享,全角,全形,加载<=>載入,默认,在线