Two algorithms to find twin prime numbers in a specified range using functional programming

Abstract

A great challenge for teaching engineers is to find applications where specific engineering is a solution to problems in other areas in such a way as to take advantage of its conceptual and instrumental potential. Such is the case of computer programming, which, as part of systems engineering, allows solving problems thanks to today’s great technological capabilities that allow taking advantage of what human knowledge has developed. This paper presents an algorithmic solution to the problem of finding twin prime numbers in a range specified by the user. The functional programming paradigm and concepts such as function, recursion, and cycles were used to solve the problem. From this perspective, reliable results were obtained that comply both with the definition of twin prime numbers and with the principles of algorithmic efficiency. It is concluded that to the extent that applications that solve problems in other areas can be shared with programming students, the concepts of a paradigm will become much more understandable and applicable, and the sense of taking advantage of technology in favor of the human being will be found.