The general quasi-order algorithm in number theory

Abstract

This paper deals with a generalization of the Binary Quasi-Order Theorem. This generalization involves a more complicated algorithm than (0.2)t. Some remarks are made on relative merits of two dual algorithms called the ψ-algorithm and the ϕ-algorithm. Some illustrative examples are given.

Keywords

• number theory
• quasi-order
• algorithm
• polygon.