简易哥德巴赫猜想(任何一个大于6的偶数可以分解成两个素数，可以利用枚举法，先把偶数可以分解的所有奇数对列出，再判断是否为素数，直到验证成功为止)-summary Goldbach conjecture (any one of the even greater than 6 can be decomposed into two prime numbers. can enumeration method, the decomposition can even first of all to the

实现杨辉三角的输出，字符指针检测回文，字符数组检测回文，字符串按要求排序，哥德巴赫猜想的验证等C语言程序，亲测有效-Print Pascal s Triangle Goldbach conjecture verification The method of judging character array palindrome