On the complementary factor in a new congruence algorithm

Peter Hilton and Jean Pedersen

International Journal of Mathematics and Mathematical Sciences, 1987, vol. 10, 1-11

Abstract:

In an earlier paper the authors described an algorithm for determining the quasi-order, Q t ( b ) , of t mod b , where t and b are mutually prime. Here Q t ( b ) is the smallest positive integer n such that t n = ± 1 mod b , and the algorithm determined the sign ( − 1 ) ϵ , ϵ = 0 , 1 , on the right of the congruence. In this sequel we determine the complementary factor F such that t n − ( − 1 ) ϵ = b F , using the algorithm rather that b itself. Thus the algorithm yields, from knowledge of b and t , a rectangular array a 1 a 2 … a r k 1 k 2 … k r ϵ 1 ϵ 2 … ϵ r q 1 q 2 … q r The second and third rows of this array determine Q t ( b ) and ϵ ; and the last 3 rows of the array determine F . If the first row of the array is multiplied by F , we obtain a canonical array, which also depends only on the last 3 rows of the given array; and we study its arithmetical properties.

Date: 1987
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/10/470759.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/10/470759.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:470759

DOI: 10.1155/S0161171287000140

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().