This present paper is inspired by one of the questions posed by Okeke (Results Math 78(96):1-30, 2023, see Remark 2.10b). In particular, we aim to develop a robust computer code based on the theoretical results obtained in Okeke (2023), which determines the polynomial solutions of the following functional equation,

for all \(x,y\in \mathbb {R}\), \(\gamma _i,\alpha _j,\beta _j \in \mathbb {R},\) and \(a_i,b_i,c_j,d_j \in \mathbb {Q},\) and their special forms. The primary motivation for writing such a computer code is that solving even simple equations belonging to class (0.1) needs long and tiresome calculations. Therefore, one of the advantages of such a computer code is that it allows us to solve complicated problems quickly, easily, and efficiently. Additionally, the computer code will significantly improve the level of accuracy in calculations. Along with that, there is also the factor of speed. We point out that the computer code will operate with symbolic calculations provided by the programming language Python, which means that it does not contain any numerical or approximate methods, and it yields the exact solutions of the equations considered.

本文的灵感来自 Okeke 提出的问题之一（Results Math 78(96):1-30, 2023，请参阅备注 2.10b）。特别是，我们的目标是基于 Okeke (2023) 中获得的理论结果开发强大的计算机代码，该代码确定以下函数方程的多项式解，

对于所有\(x,y\in \mathbb {R}\)、\(\gamma _i,\alpha _j,\beta _j \in \mathbb {R},\)和\(a_i,b_i,c_j,d_j \in \mathbb {Q},\)及其特殊形式。编写此类计算机代码的主要动机是，即使求解属于 (0.1) 类的简单方程也需要漫长而繁琐的计算。因此，这样的计算机代码的优点之一就是它可以让我们快速、轻松、高效地解决复杂的问题。此外，计算机代码将显着提高计算的准确性。除此之外，还有速度因素。我们指出，计算机代码将使用编程语言 Python 提供的符号计算进行操作，这意味着它不包含任何数值或近似方法，并且会产生所考虑方程的精确解。