Design an algorithm to find out all prime numbers within 50, and the algorithm steps are described in natural language

Cycle from 1 to 50
Then divide each number by 23456789
If the result of these 8 divisions is not an integer or = 1, then it is a prime number
If the result of the division of 8 times has an integer and is not equal to 1, then it is a composite number and jump out of this cycle
Proceed to the next cycle
The algorithm is not the best, but it's easy to understand
Hope it helps

RELATED INFORMATIONS

1. A small experiment is designed to prove the existence of air by using common articles at home
2. How many palindromes are there from one to six digits
3. A four digit palindrome number multiplied by 45 becomes a five digit palindrome number. What is the five digit palindrome number?
4. The probability of choosing a four digit number is exactly the palindrome number For example, 1111122113312552
5. There is a palindrome number with six digits. It is still palindrome number after dividing by 95. What is the six digit number
6. A natural number, whether read from left to right or right to left, is the same. It is called palindrome number. Find the average of all three palindrome numbers
7. How many palindromes are there? From small to large, what is the 100th? Please write the analysis process
8. Find the sum of the first n terms of sequence 1 / 2,1 / 4,1 / 8,1 / 16
9. The last two digits are 42, the sum of numbers is 42, and what is the smallest of the natural numbers divisible by 42? It's a process
10. 22 and 1 / 20 * 1 / 21 22 20/1*21/1
11. The palindrome number obtained by 69 is () and the palindrome number obtained by 126 is ()
12. 1. How many palindromes are there that can be divided by 9? How many palindromes are there that have hundreds of zeros among the 2 and 5 digits? How many even palindromes are there
13. It is proved that the sum of the numbers on each digit of a number divisible by 3 can be divisible by 3
14. Why is there a palindrome number that can be divided by 11 123321 3546556453 this kind of 12321 does not count only the space as the axis of symmetry, does not count the number as the palindrome number of the axis of symmetry. I accidentally found out why? What's the principle? I heard that people used a high school theorem or something
15. How to prove that even palindrome numbers can be divisible by 11? For example, 222442123321, the palindrome number of even digits can be divided by 11,
16. Java for all n values not more than 200, the square of n is the palindrome number with symmetric property The palindrome number is stored in array; Output the number of palindromes in the array
17. The palindrome number of any even length can not be prime number
18. Let m = 3-4y + y * y, n = 5Y + 3Y * Y-8, then the polynomial 19-14y-5y * y is equal to A,M-N B,M-2N C,N-M D,2N-M
19. We know that 2x + 2 = m and express 2x with an algebraic formula containing M To express the x power of 2 with an algebraic expression containing m
20. For any two integers m and n (M is greater than n), the three algebraic expressions of Pythagorean number are