Format Input The first line of the input contains an integer T, the number of test case. The next T line consist a positive integer X. Format Output For each test case, print Case #X: Y. X is the number of test case and Y is the result from function "isPrime (x)". Constraints 1<= X <= 100 2 <= X <= 1.000 Sample Input Sample Output Case #1: Prime Number Case #2: Not Prime Number Case #3: Prime Number 3 3 4 7
Format Input The first line of the input contains an integer T, the number of test case. The next T line consist a positive integer X. Format Output For each test case, print Case #X: Y. X is the number of test case and Y is the result from function "isPrime (x)". Constraints 1<= X <= 100 2 <= X <= 1.000 Sample Input Sample Output Case #1: Prime Number Case #2: Not Prime Number Case #3: Prime Number 3 3 4 7
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Write in C Language.
Input and Output must be the same
![1. [30%] Bibi is challenging you to implement a recursive function to check integer X is a prime
number or not. A prime number can be divided only by 1 and itself. You have to implement a
recursive function "int isPrime (int x)" in C.
Format Input
The first line of the input contains an integer T, the number of test case.
The next T line consist a positive integer X.
Format Output
For each test case, print Case #X: Y. X is the number of test case and Y is the result from function
"isPrime (x)".
Constraints
1<= X <= 100
2 <= X <= 1.000
Sample Input
Sample Output
Case #1: Prime Number
Case #2: Not Prime Number
Case #3: Prime Number
3
3
4
7](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F5f22aa43-03d6-46b5-b728-a5e8e0bcb567%2F00757461-5bce-41d8-8ad8-1266d99f8f72%2Fhl9jb6_processed.png&w=3840&q=75)
Transcribed Image Text:1. [30%] Bibi is challenging you to implement a recursive function to check integer X is a prime
number or not. A prime number can be divided only by 1 and itself. You have to implement a
recursive function "int isPrime (int x)" in C.
Format Input
The first line of the input contains an integer T, the number of test case.
The next T line consist a positive integer X.
Format Output
For each test case, print Case #X: Y. X is the number of test case and Y is the result from function
"isPrime (x)".
Constraints
1<= X <= 100
2 <= X <= 1.000
Sample Input
Sample Output
Case #1: Prime Number
Case #2: Not Prime Number
Case #3: Prime Number
3
3
4
7
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education