1
Ирина
no recommendations
no complaints
Closed
Project title: Mathematics.Combinatorics
Type of cooperation: One-time project
Section: Education and consulting
Prepayment: without prepayment
Payment methods: Bank transfer
Acceptance of requests: closed
Type of cooperation: One-time project
Section: Education and consulting
Prepayment: without prepayment
Payment methods: Bank transfer
Acceptance of requests: closed
Project description:
Find the number of functions f:{1,...,n}=>{1,...,m} that satisfy the conditions
M = 2,n = 3 (or vice versa m = 3,n = 2, without difference) Does not increase by {1, ....5}, max{f(x), x (belongs){5, ...,10}}=9
Please add an explanation to each step.
Find the number of functions f:{1,...,n}=>{1,...,m} that satisfy the conditions
M = 2,n = 3 (or vice versa m = 3,n = 2, without difference) Does not increase by {1, ....5}, max{f(x), x (belongs){5, ...,10}}=9
Please add an explanation to each step.
