Page 33 - The 40 Ch. Book by James Hong or 洪祥智

Chapter 7;; Math
7.1 Fermat's Theorem Fermat's Last Theorem

X^n+ Y^n = Z^n No positive integers (without positive integer)

for X, Y and Z when n is > 2

1. This topic can be solved with a computer.
2. You can use a computer to solve

3. X=Y;; X can, equal to Y

Example:

X= Y = 4 n = 3 Z = 5
X^n+ Y^n = Z^n

2(4^3) = 128 vs 5^3=125 Poor 3 (Can be, yes or no) (See
people's wisdom)

There is a tendency that this sum is changed from less than Z^n
to greater than Z^n

So at the time of derivation, we infer that there will be a sum of
positive integer combinations equal to Z^n.
The sum of positive integer combinations is (X^n + Y^n)

7.2 Calculating the pi

Math pi = Pi;; See Pi.
Circumference = d/dR pi( R^2) = 2 Pi ( R) R= Radius = radius
Use a rope or tape/ or ruler, or rope ruler measure to measure the

length of the circumference and measure the length of the
radius. Circumference = 2 Pi (radius) Substituting the

circumference, and the length of the radius, you can find Pi.

7.3 Playing card chance:
In thirteen. JQKA2 is the top number instead of JQK, so the

probability is 5/13 instead of 3/13.