Key points are not available for this paper at this time.
A prime number is a natural number with no divisors other than itself and the number 1. There are many unsolved problems related to prime numbers. One such problem is finding a general method for identifying prime numbers. Although it is known that all prime numbers fall under the categories of 2, 3, or 6n1 (where n1), a formalized method for eliminating composite numbers (non-prime numbers) from these categories has yet to be developed. This paper aims to explore a possible method for such elimination, which involves checking whether there exists an n that satisfies n = 6km+k+m or n = 6km+k-m (where k and m are non-zero integers). This method is expected to be a major step forward in the derivation of prime numbers.
Shiraishi et al. (2024) studied this question.