in Combinatory
253 views
0 votes
0 votes
use mathematical induction to prove the sum rule for m tasks from the sum rule for two tasks.
in Combinatory
253 views

1 comment

Assume the theorem is true for m-1 tasks. Try to prove yourself, you will be able to do it.
0
0

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true