-
Notifications
You must be signed in to change notification settings - Fork 82
Erdős Problem 422 #692
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Erdős Problem 422 #692
Conversation
| 1 => 1 | ||
| 2 => 1 | ||
| n => f (n - f (n - 1)) + f (n - f (n - 2)) | ||
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Here I think it would be interesting to add two statements:
- The question of the surjectivity of
f
(seems to be open) - The question of whether the sequence
f
must eventually terminate (presumably not? admittedly I haven't thought too much about whether or not this is hard to prove)
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Those sound like good ideas. I'll also add in a question of the function's growth rate since that's open as well.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Hey, I added your suggestions but I had a bit of trouble with the second.
For it, I removed the partial
definition for f
and defined the function with sorry
. I don't think this is what you had in mind when you suggested it so I'd welcome any other ways to define that f
must eventually terminate.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Perhaps by termination @Paul-Lez meant whether f
becomes stationary at some point? I.e., does there exist m
and N
for which f n = m
for all n
larger than N
. Termination can be quite surprising in this sense, see for example the Goodstein sequence which eventually decreases and terminates at 0.
The other interpretation of termination here is whether one reaches a point at which f n
cannot be defined (e.g, if n - f (n - 1) < 0
), but I think this sense is already captured in the definition.
Co-authored-by: Paul Lezeau <paul.lezeau@gmail.com>
Adds Erdős Problem 422.
The question on the function's behavior felt a bit vague, so I elected to not add it.