1University Sains Malaysia (USM), Mathematical Group, Penang, Malaysia
2Faculty of Information Technology and Quantitative Sciences, UiTM, Malaysia
3Faculty of Management, Qom Campus, University of Tehran, Iran
*E-mail: mzarafat@yahoo.com
**E-mail: jandaghi@ftmsk.uitm.edu.my, jandaghi@ut.ac.ir
***E-mail: adli@cs.usm.my
Making relation among different mathematics branches can expand the thought about solving a mathematical problem. The goldbach Conjecture is one of the mathematical problems which has not been proved since 1742. In this paper we will try to show that one is able to convert a theorem in number theory to a group of Integer Programming Problems that the proof of existence of their solutions is equivalent to the proof of the theorem.
Goldbach Conjecture, Integer programming
