All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Cyclic recursive summation (Posted on 2021-07-16) Difficulty: 5 of 5
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)

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Further thoughts (2) | Comment 2 of 9 |
Define h(a,b,c) as the expression in f. Let r,s,t be three integers > 1 such that a + b + c = r + s + t. Then h(a,b,c)  = h(r,s,t). In particular, we have 

h(a,b,c) = h(2,2,z-4)
= 2f^{4z- 18}(4z -16) + f^{3z -12}(4z -16) = z

where I have introduced z = a + b + c

For instance, if we take a=b=c=2 we get 

f^6(8) = 2

Edited on August 5, 2021, 11:38 am
  Posted by FrankM on 2021-08-04 20:28:44

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information