• 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11
  • 12
  • Hello World!

    Beautiful World, Wonderful Life.

  • Change the World by Program.

  • A language that doesn't affect the way you think about programming, is not worth knowing.

    Alan J. Perlis

  • Mosher's Law of Software Engineering

    Don't worry if it doesn't work right.
    If everything did, you'd be out of a job.

  • Any code of your own that you haven't looked at for six or more months might as well have been written by someone else. (Eagleson's law)
  • Stewart Brand


    Once a new technology starts rolling, if you're
    not part of the steamroller, you're part of the road.

  • Bjarne Stroustrup

    There are only two kinds of programming languages:
    those people always bitch about and those nobody uses.

  • Nine women can't make a baby in one month.

  • Within a computer,
    natural language is unnatural.

  • If you're the smartest person in the room, then

    you're in the wrong room.

  • Without requirements or design,
    programming is the art of adding bugs to an empty text file.

    --Louis Srygley

  • Fools ignore complexity.
    Pragmatists suffer it.
    Some can avoid it.
    Geniuses remove it.

C++ Programming and Object-Oriented Design

Project 6. Conjecturses & Theorems

 

Click to Download the Executable Files.       Click to Download the Sources Files. (Password Needed)

 

Name: Conjecture & Theorems
Copyright: Seng Dewen
Author: Seng Dewen
Date: Sept. 16, 2020
Description: Different Kinds of Prime Numbers, Conjecture & Theorems.


Menu



1. Goldbach's Conjecture(哥德巴赫猜想)


For any even number N greater than or equal to 4, there exists at least one pair of prime numbers p1 and p2 such that N = p1 + p2.


2. CollatzConjecture(考拉兹猜想)


Take any positive number: if it's even you divide it by 2 and if it's odd multiply it by 3 and add 1. Repeat this process indefinitely, no matter what number you start with, you will always end up at 1. The conjecture remains stubbornly unproven. Mathematics is not yet ready for such problems.


3. Nico Chester Theorem(尼彻斯特定理)


Any integer to the third power can be represented as the sum of a series of consecutive odd Numbers.


4. Four Square Theorem(四平方数和定理)


Four-square Theorem: Each positive integer may be expressed as the sum of the squares of four integers.


5. Sieve of Eratosthenes(埃拉托斯特尼筛选法找质数)



6. Bride & Groom(新娘和新郎)


There are 3 brides (A, B, C) and 3 grooms (X, Y, Z).

A: I will marry X.

X: My fiance is C.

C: I will marry Z.

It is known that they are all kidding.

Then, do you know who and who are a couple?


7. Truth or Lie(真实或谎言)


Ben says that Bob is lying.

Bob says that Bill is lying.

Bill says that they are all lying.

Then, do you know who is lying?


8. Exit




 

 

 

Back to Top