Exercise 2: In probability theory, one problem that often arises is determining the number of ways in which p objects can be selected from n distinct objects without regard to the order in which they are selected. Such selections are called combinations. The number of combinations ofp objects from a set with n objects is C (n, p) and is given by: n! C(n, p) = (п - р)! * р! Write a Python program which will calculate and display on the screen the number of possible combination C based on the values of n and p; where both n and p are positive integers less than 21 and n> p. Implement and use at least the following three functions: fact(..): A function when passed a positive integer value, will calculate and return the factorial of that number. comb..): A function when passed n and p (n: total number of objects and p: number of objects taken at a time) will calculate and return the total number of possible combinations (using the formula above). It calls function fact..) main(..): reads and validates the values of n and p, calls function comb(..) and prints the result. Enter n and p each in range [e, 20] and n>p:-8 10 InvalidInput, try again Enter n and p each in range [e. 20] and n>p: 5-6 Invalid input, try again Enter n and p each in range [0, 20] and n>p: S1 8 Invalid input, try again Enter n and p each in range (e, 20] and n>p: 9 17 Invalid input, try again Windows Entern and p each in range [e, 20] and n>p: 8 6 Number of combinations c(8,6)- 28 Figure 2. Exercise 2 Sample Run DELL
Exercise 2: In probability theory, one problem that often arises is determining the number of ways in which p objects can be selected from n distinct objects without regard to the order in which they are selected. Such selections are called combinations. The number of combinations ofp objects from a set with n objects is C (n, p) and is given by: n! C(n, p) = (п - р)! * р! Write a Python program which will calculate and display on the screen the number of possible combination C based on the values of n and p; where both n and p are positive integers less than 21 and n> p. Implement and use at least the following three functions: fact(..): A function when passed a positive integer value, will calculate and return the factorial of that number. comb..): A function when passed n and p (n: total number of objects and p: number of objects taken at a time) will calculate and return the total number of possible combinations (using the formula above). It calls function fact..) main(..): reads and validates the values of n and p, calls function comb(..) and prints the result. Enter n and p each in range [e, 20] and n>p:-8 10 InvalidInput, try again Enter n and p each in range [e. 20] and n>p: 5-6 Invalid input, try again Enter n and p each in range [0, 20] and n>p: S1 8 Invalid input, try again Enter n and p each in range (e, 20] and n>p: 9 17 Invalid input, try again Windows Entern and p each in range [e, 20] and n>p: 8 6 Number of combinations c(8,6)- 28 Figure 2. Exercise 2 Sample Run DELL
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
![Exercise 2:
In probability theory, one problem that often arises is determining the number of ways in which p objects can be selected from n
distinct objects without regard to the order in which they are selected. Such selections are called combinations. The number of
combinations ofp objects from a set with n objects is C (n, p) and is given by:
n!
C(n, p) =
(п - р)! * р!
Write a Python program which will calculate and display on the screen the number of possible combination C based on the
values of n and p; where both n and p are positive integers less than 21 and n> p.
Implement and use at least the following three functions:
fact(..): A function when passed a positive integer value, will calculate and return the factorial of that number.
comb(.): A function when passed n and p (n: total number of objects and p: number of objects taken at a time) will
calculate and return the total number of possible combinations
(using the formula above). It calls function fact(.)
main(..): reads and validates the values of n and p, calls function comb(..) and prints the result.
Enter n and p each in range [0,20] and n>p: -8 10
Invalidinput, try again
Enter n and p each in range [e. 20] and n>p: 5-6
Invalid input,
try again
Enter n and p each in range [e, 20] and n>p: S1 8
Invalid input, try again
Enter n and p each in range (e 20] and n>p: 9 17
Invalid input, try again
Entern
and p each in range [e, 20] and n>p:
8 6
Number of combinations c(8,6)- 28
Figure 2. Exercise 2 Sample Run
DELL](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F6afe41b9-a5e6-43e2-b1f3-6d2072e8d121%2Ff83bc75e-6840-4504-9ba6-5007391bd378%2Fjpp9aet_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Exercise 2:
In probability theory, one problem that often arises is determining the number of ways in which p objects can be selected from n
distinct objects without regard to the order in which they are selected. Such selections are called combinations. The number of
combinations ofp objects from a set with n objects is C (n, p) and is given by:
n!
C(n, p) =
(п - р)! * р!
Write a Python program which will calculate and display on the screen the number of possible combination C based on the
values of n and p; where both n and p are positive integers less than 21 and n> p.
Implement and use at least the following three functions:
fact(..): A function when passed a positive integer value, will calculate and return the factorial of that number.
comb(.): A function when passed n and p (n: total number of objects and p: number of objects taken at a time) will
calculate and return the total number of possible combinations
(using the formula above). It calls function fact(.)
main(..): reads and validates the values of n and p, calls function comb(..) and prints the result.
Enter n and p each in range [0,20] and n>p: -8 10
Invalidinput, try again
Enter n and p each in range [e. 20] and n>p: 5-6
Invalid input,
try again
Enter n and p each in range [e, 20] and n>p: S1 8
Invalid input, try again
Enter n and p each in range (e 20] and n>p: 9 17
Invalid input, try again
Entern
and p each in range [e, 20] and n>p:
8 6
Number of combinations c(8,6)- 28
Figure 2. Exercise 2 Sample Run
DELL
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 4 steps with 5 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