| dc.contributor.author |
Nagaraj, S. V. |
|
| dc.date.accessioned |
2009-08-24T05:29:22Z |
|
| dc.date.available |
2009-08-24T05:29:22Z |
|
| dc.date.issued |
2009-08-24T05:29:22Z |
|
| dc.date.submitted |
1999 |
|
| dc.identifier.uri |
http://hdl.handle.net/123456789/85 |
|
| dc.description.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. |
en_US |
| dc.subject |
Algorithmic Number Theory |
en_US |
| dc.subject |
Computational Number Theory |
en_US |
| dc.title |
Problems in Algorithmic Number theory |
en_US |
| dc.type.degree |
Ph.D |
en_US |
| dc.type.institution |
University of Madras |
en_US |
| dc.description.advisor |
Raman, Venkatesh |
|
| dc.description.pages |
iv; 51p. |
en_US |
| dc.type.mainsub |
Computer Science |
en_US |