Kaprekar’s routine in polynomial rings
The process of order, reverse and subtract is taken from integers right to polynomial rings with coefficients in a finite field. We do such essentially for prime fields but we also comment a little on non prime fields. Given that Kaprekar’s routine depends so much in the order of the set we work in,...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2020 |
| País: | México |
| Institución: | Universidad Autónoma de Yucatán |
| Repositorio: | Repositorio Digital Institucional de la Universidad Autónoma de Yucatán |
| Idioma: | inglés |
| OAI Identifier: | oai:redi.uady.mx:123456789/4761 |
| Acceso en línea: | http://redi.uady.mx:8080/handle/123456789/4761 |
| Access Level: | acceso abierto |
| Palabra clave: | info:eu-repo/classification/cti/1 Finite field Polynomial rings Kaprekar’s routine Kaprekar phenomena |
| Sumario: | The process of order, reverse and subtract is taken from integers right to polynomial rings with coefficients in a finite field. We do such essentially for prime fields but we also comment a little on non prime fields. Given that Kaprekar’s routine depends so much in the order of the set we work in, we first give an order to the polynomial rings in question and then, we focus on the number and length of the cycles associated to this routine, specifically for the two and three digits polynomials case. |
|---|