Cherng-Tiao Perng

On the Compatibility of Bézout Coefficients between Pythagorean Pairs under Unimodular Transformations

Cherng-Tiao Perng & Maila Brucal-Hallare · Journal of Advances in Mathematics and Computer Science · 2019

In a recent preprint, Gullerud and Walker proved a theorem and made a conjecture about thecorrectness of efficiently generating Bézout trees for Pythagorean pairs. In this note, we give a simple proof of their theorem, conrm that their conjecture is true, and furthermore we give...

Open access Research Article 10.9734/jamcs/2019/v31i430120

A Note on Gordan's Theorem

Cherng-Tiao Perng · Journal of Advances in Mathematics and Computer Science · 2015

Inspired by Gale's proof of Farkas's lemma, this expository note aims to give a very simple and intuitive proof of Gordan's theorem and the equivalence of this theorem to Farkas's lemma and some formulations of the separating hyperplane theorems. The tool we have employed is limi...

Open access Research Article 10.9734/BJMCS/2015/19134

A Phenomenon in Fibonacci Numbers and Its Generalization

Cherng-Tiao Perng & Boyd Coan · Journal of Advances in Mathematics and Computer Science · 2015

Motivated by the result of Fibonacci numbers for which the ratio of successive terms tends to a limit, which is commonly known as the Golden Ratio, we prove an immediate generalization for a wider class of recurrence sequences. We note that such limiting behavior for ratio of suc...

Open access Research Article 10.9734/BJMCS/2015/18126