On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function

dc.rights.license	CC BY	eng
dc.contributor.author	Hubálovský, Štěpán	cze
dc.contributor.author	Trojovská, Eva	cze
dc.date.accessioned	2025-12-05T09:22:46Z
dc.date.available	2025-12-05T09:22:46Z
dc.date.issued	2020	eng
dc.identifier.issn	2227-7390	eng
dc.identifier.uri	http://hdl.handle.net/20.500.12603/1122
dc.description.abstract	Let Fn be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest positive integer k such that Fk equivalent to 0(modn). In this paper, we shall find all positive solutions of the Diophantine equation z(phi(n))=n, where phi is the Euler totient function.	eng
dc.format	p. "Article Number: 1796"	eng
dc.language.iso	eng	eng
dc.publisher	MDPI-Molecular diversity preservation international	eng
dc.relation.ispartof	Mathematics, volume 8, issue: 10	eng
dc.subject	Fibonacci numbers	eng
dc.subject	order of appearance	eng
dc.subject	Euler totient function	eng
dc.subject	fixed points	eng
dc.subject	Diophantine equations.	eng
dc.title	On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function	eng
dc.type	article	eng
dc.identifier.obd	43876909	eng
dc.identifier.doi	10.3390/math8101796	eng
dc.publicationstatus	postprint	eng
dc.peerreviewed	yes	eng
dc.source.url	https://www.mdpi.com/2227-7390/8/10/1796	cze
dc.relation.publisherversion	https://www.mdpi.com/2227-7390/8/10/1796	eng
dc.rights.access	Open Access	eng