Definition 1 Markoff numbers

The Diophantine equation

x2 + y2 + z2 = 3xyz (1.1)
was first studied by Andrei A. Markoff in 1879. The positive solutions (x,y,z), x ≤ y ≤ z, of the
Diophantine equation form a tree rooted at (1,1,1), using the branching operations
(x, y, z) → (x, y, 3xy-z),
(x, y, z) → (x, z, 3xz−y),
(x, y, z) → (y, z, 3yz−x).
We refer to any positive solution (x, y, z) of (1.1) (not necessarily with x ≤ y ≤ z) as a Markoff
triple. The numbers z in an ordered Markoff triples x ≤ y ≤ z are called Markoff numbers.

Comment:
Palitan niyo yung definition niyo sa powerpoint, para mas clear at direct to the point yung nasa
taas na lang ang gamitin.

Take note: Kung matanong kayo kung anong relationship ng Diophantine Equations sa Markoff
numbers, ang isasagot niyo lang ay ganito “Diophantine equation is an equation in which only
integer solutions are allowed, the formula x2 + y2 + z2 = 3xyz is a Markoff Equation and a
Diophantine equation since it has no other solutions other than an integer”.

Ang gusto lang iparating ng definition na iyan ay, ang Markoff Diophanntine equation na
x2 + y2 + z2 = 3xyz ay may positive solutions na (x, y, z) na kung saan (x ≤ y ≤ z) ang z ang
pinakamataas na Markoff number kaysa sa x at y. At mula dito ay makakabuo ng isang Markoff
tree na may initial value na (1, 1, 1) sa pamamagitan ng tinatawag nating branching operations
na (x, y, z) → (x, y, 3xy-z),(x, y, z) → (x, z, 3xz−y),(x, y, z) → (y, z, 3yz−x).
Ito yung proof na sinasabi ko, ilabas niyo lang kung kailangan at hinahanap ng panel:

We have a Markoff Equation

x2 + y2 + z2 = 3xyz
Proposition: If (x, y, z) = (a, b, c) is a Markoff triple, then (a, b, 3ab – c) is also a Markoff triple.
Proof:
Let: a2 + b2 + c2 = 3abc

a2 + b2 + c2 = 3abc
a2 + b2 + (3ab - c)2 = 3abc
a2 + b2 + 9a2b2 – 6abc + c2 = 3abc
But: a2 + b2 + c2 = 3abc
9a2b2 – 6abc + 3abc = 3abc
9a2b2 – 3abc = 3abc
3ab (3ab – c) = 3abc (Common Monomial Factor)
3ab – c = c (Division Property of Equality)

Since c = 3ab – c, Therefore the triple (a, b, 3ab – c) is also a Markoff triple. QED

From these solutions we can also get (a, c, 3ac – b) and (b, c, 3bc – a) that are also Markoff
triples that we can get from the initial triple (a, b, c).

Comment:
Kayo na lang ang mag-solve para sa (a, c, 3ac – b) at (b, c, 3bc – a) kailangan yung proof na
iyan kasi diba may tinatawag tayong branching doon sa tree, para makuha natin yung mga
susunod na branch may formula na ginagamit. Which is (a, c, 3ac – b), (b, c, 3bc – a), at
(a, b, 3ab – c) kailangan kasi mapatunayan na yung 3ac – b, 3bc – a, 3ab – c ay Markoff
number din, para walang violation.
Comment:
Finally, huwag niyo na pala ipakita yung generator na ipinakita ko sa inyo, may weakness
kasi iyon. May mga Markoff numbers na hindi niya kayang i-generate, in short haggang first
branching lang ang Markoff numbers na kaya nitong i-generate.

Suggestion ko lang, na kapag hinanapan kayo ng generating function o yung formula na

nagpapalabas ng mga Markoff numbers. Ang sasabihin niyo na lang ay gumagamit kayo ng
branching operations para makuha ang mga elements ng Markoff numbers.
Na kung saan sa Markoff triple na (x, y, at z) ang z ang Markoff number.
Kapag namilit sila, doon niyo lang ipapakita yung generating functions na ibinigay ko sa
inyo, pero sabihin niyo hanggang first level of branching lang kasi ang kaya nitong i-generate.
Kaya hindi reliable na gamitin.

Yung mga formula na nandiyan hindi natin pwede tawaging generating function, dahil ang
mismong explanation na ito sa ibaba ay property ng Markoff number.
Pwede niyo ito idagdag sa inyong properties:
Medyo ayusin niyo lang.

Property 1
All the Markoff numbers on the regions adjacent to 2's region are

odd-indexed Pell numbers , and all the Markoff numbers on the regions

adjacent to 1's region are odd-indexed Fibonacci numbers. Thus, there are

infinitely many Markov triples of the form

(1, F2n-1, F2n+1), where Fx is the xth Fibonacci number. Likewise,

there are infinitely many Markov triples of the form

(2, P2n-1, P2n+1), where Px is the xth Pell number.