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.
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.
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
100%
![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 of p objects from a set with n objects is C (n, p) and is given by:
п!
С(п, р) —
(п- р)! * 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:
Invalid input, try again
-8 10
Enter n and p each in range [0,20] and n>p: 5
Invalid input, try again
-6
Enter n and p each in range [0,20] and n>p: 51 8
Invalid input, try again
Enter n and p each in range [0,20] and n>p: 9 17
Invalid input, try again
Enter n and p each in range [0,20] and n>p: 8 6
Number of combinations c(8,6) - 28
Figure 2. Exercise 2 Sample Run](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F87bfaa2c-2576-405e-816b-65433b8ec3b3%2Fa2b4ca37-3cc3-4552-9f8c-d1f368b9af1b%2Fjf5k28_processed.png&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 of p objects from a set with n objects is C (n, p) and is given by:
п!
С(п, р) —
(п- р)! * 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:
Invalid input, try again
-8 10
Enter n and p each in range [0,20] and n>p: 5
Invalid input, try again
-6
Enter n and p each in range [0,20] and n>p: 51 8
Invalid input, try again
Enter n and p each in range [0,20] and n>p: 9 17
Invalid input, try again
Enter n and p each in range [0,20] and n>p: 8 6
Number of combinations c(8,6) - 28
Figure 2. Exercise 2 Sample Run
Expert Solution
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 3 images
