Power of n and nth root of multi-digit numbers based on recurrent relations
It is described the method of raising to a power of n and the method of getting nth root of multi-digit numbers basing on recurrent relations. Described methods are general methods of square, cube and general methods of square, cube roots. The method of getting nth root of multi-digit numbers is bas...
Saved in:
| Date: | 2017 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | Russian |
| Published: |
PROBLEMS IN PROGRAMMING
2017
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/135 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
| Download file: |  |
Institution
Problems in programming| Summary: | It is described the method of raising to a power of n and the method of getting nth root of multi-digit numbers basing on recurrent relations. Described methods are general methods of square, cube and general methods of square, cube roots. The method of getting nth root of multi-digit numbers is based on the method of getting power of n. The method of getting nth root does not use trivial division. While nth root and power of n of multi-digit numbers are calculated the powers up to n-1 are cal-culated at the same time. The methods are bitrate where next bit (n bits – on getting nth root) of original bit sequence is handled on iteration. |
|---|