Ask for two user inputs n1 and n2. Keep asking for inputs until the conditions below are satisfied. Both n1 and n2 must be positive integers. n1 should be less than n2. Then print the following: Condition 1: Count all numbers between n1 and n2 that are divisible by 7 and not divisible by 3 Condition 2: Count all numbers between nl and n2 that are divisible by 5 Condition 3: Count all numbers between nl and n2 that are divisible by 5 and divisible by 9

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%

'Hello need another expert's advice on how to program this one using Python 3. (see image)

Ask for two user inputs n1 and n2. Keep asking for inputs until the conditions below are satisfied.
Both n1 and n2 must be positive integers. n1 should be less than n2.
Then print the following:
Condition 1: Count all numbers between n1 and n2 that are divisible by 7 and not divisible by 3
Condition 2: Count all numbers between n1 and n2 that are divisible by 5
Condition 3: Count all numbers between n1 and n2 that are divisible by 5 and divisible by 9
Sample Input #2
Sample Input #1
3
1
46
1
1
Sample Output #1
Enter nl: Enter n2: Number of integers that satisfy A from 3 to 46: 4
Number of integers that satisfy B from 3 to 46: 9
Number of integers that satisfy C from 3 to 46: 1
Sample Output #2
Enter nl: Enter n2: Invalid input.
Enter nl: Enter n2: Invalid input.
Enter nl: Enter n2: Number of integers that satisfy A from 1 to 2: 0
Number of integers that satisfy B from 1 to 2: 0
Number of integers that satisfy C from 1 to 2: 0
Transcribed Image Text:Ask for two user inputs n1 and n2. Keep asking for inputs until the conditions below are satisfied. Both n1 and n2 must be positive integers. n1 should be less than n2. Then print the following: Condition 1: Count all numbers between n1 and n2 that are divisible by 7 and not divisible by 3 Condition 2: Count all numbers between n1 and n2 that are divisible by 5 Condition 3: Count all numbers between n1 and n2 that are divisible by 5 and divisible by 9 Sample Input #2 Sample Input #1 3 1 46 1 1 Sample Output #1 Enter nl: Enter n2: Number of integers that satisfy A from 3 to 46: 4 Number of integers that satisfy B from 3 to 46: 9 Number of integers that satisfy C from 3 to 46: 1 Sample Output #2 Enter nl: Enter n2: Invalid input. Enter nl: Enter n2: Invalid input. Enter nl: Enter n2: Number of integers that satisfy A from 1 to 2: 0 Number of integers that satisfy B from 1 to 2: 0 Number of integers that satisfy C from 1 to 2: 0
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY