A proving question?

0 ⤊

permutation mapping problem:

Two permutations a and b are said to be disjoint, if a(i) not equal to i implies that b(i) = i, and, b(j) not equal to j implies that a(j) = j. prove that disjoint permutations commute with one another.

thank you.

2006-10-03 13:39:32 · 3 answers · asked by David F 2 in Science & Mathematics ➔ Mathematics

3 answers

Easy homework. Try an example or two to get the idea.

2006-10-03 13:55:54 · answer #1 · answered by mathematician 7 · 0⤊ 0⤋

You really expect someone to just sit here and do your homework for you for free? This ain't a simple algebra problem, bud...

2006-10-03 20:47:05 · answer #2 · answered by Anonymous · 0⤊ 0⤋

.......dead..............no signal

2006-10-03 20:40:36 · answer #3 · answered by Al Kaholic 2 · 0⤊ 0⤋