Skip to main content
Toggle navigation
Secondary menu
about Plus
support Plus
Plus sponsors
subscribe to Plus
terms of use
Search form
Search
Home
Articles
News
Packages
Podcasts
Puzzles
Reviews
Videos
Login
Mathematical mysteries: Hailstone sequences
Add new comment
this is easy to prove
Permalink
Submitted by
Anonymous
on October 9, 2014
Consider that the n+2 iteration of the function is always less than the nth iteration.
reply
Your name
Subject
Comment
*
More information about text formats
Filtered HTML
Plain text
CAPTCHA
This question is for testing whether you are a human visitor and to prevent automated spam submissions.
Preview
Leave this field blank

## this is easy to prove

Consider that the n+2 iteration of the function is always less than the nth iteration.