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...
Збережено в:
| Дата: | 2017 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | Russian |
| Опубліковано: |
PROBLEMS IN PROGRAMMING
2017
|
| Теми: | |
| Онлайн доступ: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/135 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Problems in programming |
| Завантажити файл: |  |
Репозитарії
Problems in programming| Резюме: | 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. |
|---|