A pitch is used to bury your screenplay? True or false

Write a program that prompts the user to enter in a postive number. Only accept positive numbers - if the user supplies a negati

marusya05 [52]

Answer:

The c++ program to check prime numbers is shown below.

#include <iostream>

using namespace std;

int main() {

int num, prime=0;

do

{

cout<<"Enter a positive number."<<endl;

cin>>num;

if(num<1)

{

cout<<"Invalid number. Enter a positive number"<<endl;

cin>>num;

}

}while(num<1);

if(num==1 || num==2 || num==3)

cout<<num<<" is a prime number."<<endl;

else if(num%2 == 0)

cout<<num<<" is not a prime number."<<endl;

else

{

for(int k=3; k<num/2; k++)

{

if(num%k == 0)

prime++;

}

if(prime>1)

cout<<num<<" is not a prime number."<<endl;

else

cout<<num<<" is a prime number."<<endl;

}

OUTPUT

Enter a positive number.

-7

Invalid number. Enter a positive number

0

Enter a positive number.

79

79 is a prime number.

Explanation:

The user input is validated for positivity. A do while loop along with an if statement is implemented for verification.

do

{

cout<<"Enter a positive number."<<endl;

cin>>num;

if(num<1)

{

cout<<"Invalid number. Enter a positive number"<<endl;

cin>>num;

}

}while(num<1);

The test for prime number is done by using multiple if else statements.

If user inputs 1, 2, or 3, message is displayed.

Else If user inputs an even number, message is displayed for not prime. This is done by taking modulo of the number upon division by 2.

Else if user inputs neither an even number nor a number less than 3, the modulus of the number is taken with divisors beginning from 3 up to half of the input number.

For this, an integer variable prime is initialized to 0. A number can be completely divisible by itself or by its factors.

If the number is divisible by any of the divisors, value of variable prime is increased by 1. If value of prime is greater than 1, this means that the user input is divisible by more than one divisor. Hence, the given number is not a prime number.

5 0

3 years ago

How is the phrase "employability skills" defined?

Digiron [165]

Answer:

Problem-solving. Why is problem-solving so valued? Companies face a lot of obstacles. Those better able to cope

Explanation:

7 0

3 years ago

Read 2 more answers

What would be the purpose of grouping worksheets in a workbook?

Nikolay [14]

Answer: A

Explanation:

3 0

3 years ago

Is this the usb cable that transfers pdf files from a phone to a another computer that doesn't belong to mines?

Dmitrij [34]

yes that is a usb cable

hope that helped

5 0

3 years ago

Design a finite automata from regular expression 10(0+11)0*1

Vilka [71]

<h3>What is a Finite automata?</h3>

A finite state machine (FSM) or finite state automaton (FSA), or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM may change from one state to another in response to some input; the change from one state to another is called a transition. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition. Finite-state machines are of two types - deterministic finite-state machines and non-deterministic finite-state machines. A deterministic finite-state machine can be constructed equivalent to any non-deterministic machine.

With that being said, the DFA is equivalent to the expression 10(0+11)0*1 The expression that you've specified requires at least three 1 to be accepted. Breaking it down into parts.

<h3>Writting the automata:</h3>

S0: 1 => S1 ; 1

S0: 0 => error ; 0

S1: 0 => S1 ; 10+

S1: 0 => S2 ; 10(0

S2: 0 => S2

S2: 1 => S3

S3: 1 => S4

S4: 0 => S4

S4: 1 => S5

S5: 1 => S6 (final state)

See more about automata at brainly.com/question/14937298

#SPJ1

7 0

2 years ago