rectify the question first.. if it is prime then how it is possible to divisible by 3
Prime numbers that are divisible by 3 don't exist. It's a contradictio in terminis ;)
Prime numbers are divisible because any numbers that are divisible are prime. If a number isn't divisible, it isn't prime. Prime numbers have to be divisible by at least one pair of numbers to be prime.
In order to draw a flow chart to display the prime numbers between 1 and 100, the rules of prime numbers must be implemented. These are that the number is only divisible by itself and one.
No prime numbers are divisible by 250. A prime number is only divisible by 1 and itself.
Prime numbers are only divisible by 1 and themselves. So, a prime number cannot be divisible by 10. The only prime number that is divisible by 2 is 2 itself; all other numbers divisible by 2 are not prime numbers.
Prime numbers are by definition only divisible by 1 and itself.
No prime numbers are only divisible by one and by themselves.
In contrast, no prime numbers are divisible by 10. Any prime number is divisible only by itself and 1.
No prime numbers are divisible by 3. By definition a prime number isn't divisible by anything but itself and 1.
There aren't any prime numbers divisible by 4. Prime numbers aren't divisible by anything except 1 and the number.
Prime numbers are not divisible by any numbers other than themselves and 1.
Prime numbers are only divisible by 1 and itself... so no prime number can be divisible by the numbers you listed.
A) Here's an example of a flowchart and pseudocode that could be used to display the prime numbers between 1 and 10000: Flowchart: START Set up an array of numbers from 1 to 10000 Set an empty array to store the prime numbers Set i = 2, the first prime number For each number in the array, check if it is divisible by i If it is divisible by i, it is not a prime number and move to the next number in the array If it is not divisible by i, it is a prime number and add it to the prime numbers array Increase i by 1 and go back to step 4 Repeat steps 4 through 7 until i is greater than the square root of 10000 Display the prime numbers array END