Cycles in sums of prime factors

dc.contributor	Universidade Estadual Paulista (UNESP)
dc.creator	Zeleny, Enrique
dc.date	2016-10-26T17:49:30Z
dc.date	2016-10-26T17:49:30Z
dc.date.accessioned	2017-04-06T11:44:12Z
dc.date.available	2017-04-06T11:44:12Z
dc.identifier	http://acervodigital.unesp.br/handle/unesp/361595
dc.identifier	http://objetoseducacionais2.mec.gov.br/handle/mec/6138
dc.identifier.uri	http://repositorioslatinoamericanos.uchile.cl/handle/2250/957877
dc.description	Knowledge about number theory and prime numbers
dc.description	Define the function sopfr that is the sum of the prime factors of n. The iteration of x->sopfr(ax+b) invariably (for the numbers explored) leads to closed loops of varying length for integers a and b. On the graph, the red dot indicates the beginning of the current cycle. It is not known if every iteration is eventually periodic, or if there is a finite number of limit cycles
dc.description	Componente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática
dc.relation	208CyclesInSumsOfPrimeFactors.nbp
dc.rights	Demonstration freeware using Mathematica Player
dc.subject	Number Theory
dc.subject	Prime Numbers
dc.subject	Educação Superior::Ciências Exatas e da Terra::Matemática::Teoria dos Números
dc.title	Cycles in sums of prime factors
dc.type	Otro