Exotic Collatz cycles
John L. Simons (2008)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
John L. Simons (2008)
Acta Arithmetica
Similarity:
J. Węgrzyn (1971)
Applicationes Mathematicae
Similarity:
Hong Wang (2012)
Discussiones Mathematicae Graph Theory
Similarity:
We prove that if G is a graph of order 5k and the minimum degree of G is at least 3k then G contains k disjoint cycles of length 5.
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
John Simons, Benne de Weger (2005)
Acta Arithmetica
Similarity:
R. Parimala, V. Suresh (1995)
Inventiones mathematicae
Similarity:
R. Parimala, V. Suresh (1996)
Inventiones mathematicae
Similarity:
Stewart, Iain A., Thompson, Ben (1995)
Experimental Mathematics
Similarity:
Władysław Narkiewicz (2002)
Journal de théorie des nombres de Bordeaux
Similarity:
It is shown that the methods established in [HKN3] can be effectively used to study polynomial cycles in certain rings. We shall consider the rings and shall describe polynomial cycles in the case when is either odd or twice a prime.
W. Puckett (1938)
Fundamenta Mathematicae
Similarity:
John L. Simons (2008)
Acta Arithmetica
Similarity:
Edward G. Belaga (2003)
Acta Arithmetica
Similarity:
B. Kaufmann (1939)
Compositio Mathematica
Similarity:
E. Kolasińska (1980)
Applicationes Mathematicae
Similarity:
Walden, Byron L. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity: