Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Chen's theorem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Every large even number is either sum of a prime and a semi-prime or two primes}} [[File:Chen Jing-run.JPG|right|thumb|The statue of Chen Jingrun at [[Xiamen University]].]] In [[number theory]], '''Chen's theorem''' states that every sufficiently large [[parity (mathematics)|even]] number can be written as the sum of either two [[prime number|primes]], or a prime and a [[semiprime]] (the product of two primes). It is a weakened form of [[Goldbach's conjecture]], which states that every even number is the sum of two primes.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)