Rational Divide-and-Conquer Relations
Keyword(s):
A rational divide-and-conquer relation, which is a natural generalization of the classical divide-and-conquer relation, is a recursive equation of the form f(bn)=R(f(n),f(n),…,f(b−1)n)+g(n), where b is a positive integer ≥2; R a rational function in b−1 variables and g a given function. Closed-form solutions of certain rational divide-and-conquer relations which can be used to characterize the trigonometric cotangent-tangent and the hyperbolic cotangent-tangent function solutions are derived and their global behaviors are investigated.
2003 ◽
Vol 03
(03)
◽
pp. 307-334
Keyword(s):
1987 ◽
Vol 134
(6)
◽
pp. 368
2019 ◽
Keyword(s):
2010 ◽
Vol E93-B
(12)
◽
pp. 3461-3468
◽
2020 ◽
Vol 11
(3)
◽
pp. 239-265
Keyword(s):
Keyword(s):
2020 ◽
Vol 19
(0)
◽
pp. 81-89
2020 ◽
Keyword(s):