Iterative roots of some functions
Author(s) -
Sukrawan Mavecha,
Vichian Laohakosol,
Boonrod Yuttanan
Publication year - 2018
Publication title -
turkish journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.454
H-Index - 27
eISSN - 1303-6149
pISSN - 1300-0098
DOI - 10.3906/mat-1612-67
Subject(s) - mathematics , integer (computer science) , combinatorics , function (biology) , fixed point , iterative method , mathematical analysis , algorithm , evolutionary biology , computer science , biology , programming language
The iterative equation f(x) = g(x) , x ∈ X for a given function g and a positive integer q is solved in the following two main cases: (i) X = Z , g(x) = ax+ b , (a, b ∈ Z ; a ̸= 0, 1); (ii) X = N ∪ {0} , g is increasing with no fixed point.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom