Prime Number Generation Program plan: • Declare a function named “checkPrime()” that accepts an input number. ○ Use a “for” loop to check whether the passed number has any factor in the range from “2” to “mynum-1”. ○ Inside the “for” loop, use “if” statement to check whether the passed number is divisible by the current loop variable. ○ If the condition is true, then print the message “The number is not a prime number” along with the passed number and exit the loop. ○ If the passed number does not have factors in the range of integers from “2” to “mynum-1”, then print the message “The number is a prime number” along with the passed number. • In the “main()” function, perform the following steps: ○ Get a number from the user and store it in a variable “howMany”. ○ Now, create a list of integers from “2” to “howMany” using the built-in functions “list()” and “range()”. ○ Using a “for” loop, call the function “checkPrime()” to check whether the current element in the list is a prime number. • Finally, call the function “main()” to execute the program.

Question

Want to see the full answer?

Answer 1

Question

Chapter 7, Problem 12PE

Program Plan Intro

Prime Number Generation

Program plan:

• Declare a function named “checkPrime()” that accepts an input number.

○ Use a “for” loop to check whether the passed number has any factor in the range from “2” to “mynum-1”.

○ Inside the “for” loop, use “if” statement to check whether the passed number is divisible by the current loop variable.

○ If the condition is true, then print the message “The number is not a prime number” along with the passed number and exit the loop.

○ If the passed number does not have factors in the range of integers from “2” to “mynum-1”, then print the message “The number is a prime number” along with the passed number.

• In the “main()” function, perform the following steps:

○ Get a number from the user and store it in a variable “howMany”.

○ Now, create a list of integers from “2” to “howMany” using the built-in functions “list()” and “range()”.

○ Using a “for” loop, call the function “checkPrime()” to check whether the current element in the list is a prime number.

• Finally, call the function “main()” to execute the program.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

After playing our giving implementation, your task is to implement Dinning Philosophers with semaphore in C, by including and Your implementation will require creating five philosophers, each identified by a number 0.4. Each philosopher will run as a separate thread. Create threads using Pthreads as discussed in the Lecture slides on Chapter 4 and Practice Lab on Threads. Your solution needs to accomplish the following: Implement in C (15 points) 1. dp1.c - You are to provide your solution to this assignment as a single C program named 'dp1.c using semaphore. Explain in you code (as comments) that the dead lock will happen or not. If there is a possible deadlock, you can simply solve the deadlock by pick the fork in order like the first solution in our slides. Solve Deadlock by Footman (15 points) 1. Here is a new solution to overcome the deadlock. The Dining Philosophers decide to hire a footman whose task to allow only four philosophers to sit on the table. When entering and…

8.4 Self-Bias Configuration 20. Determine Zi. Zo. and A,, for the network of Fig. 8.73 if gf, = 3000 μS and gos = 50 μs. 21. Determine Z, Zo, and A, for the network of Fig. 8.73 if the 20-uF capacitor is removed and the parameters of the network are the same as in Problem 20. Compare results with those of Problem 20. +12 V 3.3 ΚΩ HE C₂ Vo Z Zo C₁ 10 ΜΩ Z₁ 1.1 ΚΩ Cs 20 µF FIG. 8.73 Problems 20, 21, 22, and 59.

21. Determine Zi, Zo, and A, for the network of Fig. 8.73 if the 20-μF capacitor is removed and the parameters of the network are the same as in Problem 20. Compare results with those of Problem 20. +12 V 3.3 ΚΩ +6 C₂ C₁ Z₁ 10 ΜΩ 1.1 ΚΩ Cs 20 μF FIG. 8.73 Zo