Problems in Algorithmic Number theory

DSpace/Manakin Repository

Problems in Algorithmic Number theory

Show full item record

Title: Problems in Algorithmic Number theory
Author: Nagaraj, S. V.
Advisor: Raman, Venkatesh
Degree: Ph.D
Main Subjects: Computer Science
Institution: University of Madras
Year: 1999
Pages: iv; 51p.
Abstract: This thesis presents new results for four problems in the field of Algorithmic and Computational Number Theory. The first gives an improved analysis of algorithms for testing whether a given positive integer n is a perfect power. The second problem gives an improved upper bound on the worst case numbers for a variant of the strong pseudo prime test, very close to settling a Granville's Conjecture. The third result is about progress towards a conjecture of S.W. Graham; It is shown that his conjecture is true for an improved condition. The fourth result deals with the problem of finding the least witness w(n) of a composite number n. A number w is a witness for a composite number n if n is not a strong Pseudo-prime to the base w. Other interesting algorithmic results about witnesses are also presented.
URI: http://hdl.handle.net/123456789/85

Files in this item

Files Size Format View
UNMTH60.pdf 3.137Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record

Search DSpace


Advanced Search

Browse

My Account