![[-]](/~ygleyzer/course.wiki/images/button-minus.gif)
Q1 clarification (regarding proof of recursion formula)
by algo092 - Tuesday, 26 May 2009 18:57:39
In this question, there is no need to prove the recursion formula according to the "misgeret" given in class.
You can simply prove the formula correctness by "הכלה דו-כיוונית".
You can simply prove the formula correctness by "הכלה דו-כיוונית".
Re: Q1 clarification (regarding proof of recursion formula)
by shre - Friday, 29 May 2009 11:57:53
Is it ok to prove the correctness of the recursive formula by induction?
there aren't two directions to this type of proof.
Re: Q1 clarification (regarding proof of recursion formula)
by ohado - Saturday, 30 May 2009 02:25:51
two directions which every one of them proved by induction:
M[v,T] = "true" <=> colorful path exists made of the colors {t1,t2,...,tl} ends at v
M[v,T] = "true" <=> colorful path exists made of the colors {t1,t2,...,tl} ends at v