An improved estimate concerning 3n+1 predecessor sets

Günther Wirsching

Acta Arithmetica (1993)

  • Volume: 63, Issue: 3, page 205-210
  • ISSN: 0065-1036

How to cite

top

Günther Wirsching. "An improved estimate concerning 3n+1 predecessor sets." Acta Arithmetica 63.3 (1993): 205-210. <http://eudml.org/doc/206516>.

@article{GüntherWirsching1993,
author = {Günther Wirsching},
journal = {Acta Arithmetica},
keywords = {Krasikov inequalities; Collatz function; -conjecture; trajectories},
language = {eng},
number = {3},
pages = {205-210},
title = {An improved estimate concerning 3n+1 predecessor sets},
url = {http://eudml.org/doc/206516},
volume = {63},
year = {1993},
}

TY - JOUR
AU - Günther Wirsching
TI - An improved estimate concerning 3n+1 predecessor sets
JO - Acta Arithmetica
PY - 1993
VL - 63
IS - 3
SP - 205
EP - 210
LA - eng
KW - Krasikov inequalities; Collatz function; -conjecture; trajectories
UR - http://eudml.org/doc/206516
ER -

References

top
  1. [1] R. E. Crandall, On the '3x+1' problem, Math. Comp. 32 (1978), 1281-1292. Zbl0395.10013
  2. [2] I. Krasikov, How many numbers satisfy the 3x+1 conjecture?, Internat. J. Math. Math. Sci. 12(4) (1989), 791-796. Zbl0685.10008
  3. [3] J. C. Lagarias, The 3x+1 problem and its generalizations, Amer. Math. Monthly 92 (1985), 3-21. Zbl0566.10007
  4. [4] H. Müller, Das '3n+1' Problem, Mitt. Math. Ges. Hamburg 12 (1991), 231-251. 
  5. [5] J. W. Sander, On the (3N+1)-conjecture, Acta Arith. 55 (1990), 241-248. Zbl0707.11017

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.