Kaprekar’s routine in polynomial rings

dc.contributor	ALAN DANIEL VILLANUEVA PAREDES
dc.coverage.spatial	Generación de conocimiento
dc.creator	JOSE ALEJANDRO LARA RODRIGUEZ
dc.date	2020-12-28
dc.date.accessioned	2021-06-22T17:37:23Z
dc.date.available	2021-06-22T17:37:23Z
dc.identifier	https://intranet.matematicas.uady.mx/journal/index.php
dc.identifier.uri	http://redi.uady.mx:8080/handle/123456789/4761
dc.description.abstract	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.
dc.language	eng
dc.publisher	Abstraction & Application
dc.relation	citation:0
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/4.0
dc.source	urn:issn:2007-2635
dc.subject	info:eu-repo/classification/cti/1
dc.subject	CIENCIAS FÍSICO MATEMÁTICAS Y CIENCIAS DE LA TIERRA
dc.subject	Finite field
dc.subject	Polynomial rings
dc.subject	Kaprekar’s routine
dc.subject	Kaprekar phenomena
dc.title	Kaprekar’s routine in polynomial rings
dc.type	info:eu-repo/semantics/article