A Formula That Generates Prime Numbers: Una Fórmula Que Genera Números Primos
Сохранить в:
| Автор: | |
|---|---|
| Формат: | artículo original |
| Статус: | Versión publicada |
| Дата публикации: | 2021 |
| Описание: | There are various classes of functions that generate prime numbers, some of them are evencapable of producing the nth prime number as is the case of the formula by Willans (1964) and Ruizand Sondow (2014). In this work a function a(n) based on the divisor function d(n) is offered as aproposal, which generates prime numbers. For the sequence defined as: a(n) = n · 2/(n−d(n)) with n>1, it is proved that a(n) produces only zeros and primes: a(n) = 0 if n is composite or a(n) = n if n is prime |
| Страна: | Portal de Revistas TEC |
| Институт: | Instituto Tecnológico de Costa Rica |
| Repositorio: | Portal de Revistas TEC |
| Язык: | Español |
| OAI Identifier: | oai:ojs.pkp.sfu.ca:article/5736 |
| Online-ссылка: | https://revistas.tec.ac.cr/index.php/matematica/article/view/5736 |