Home > Just Math
Cyclic recursive summation (Posted on 2021-07-16) |
|
Let N be the set of positive integers. Find all functions f:N->N that satisfy the equation
fabc-a(abc) + fabc-b(abc) + fabc-c(abc) = a + b + c
for all a, b, c ≥ 2.
(Here f1(n) = f(n) and fk(n) = f(fk-1(n)) for every integer k greater than 1)
(Also note: abc is the product a·b·c and not the concatenation 100a+10b+c)
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|