0 votes 0 votes Let $w \in \sum$$*$ be a string, with $\sum$ being the alphabet. Let $w^R$ be the reversal of string $w$, using induction prove that $(w^R)(w^R). . .(\text{for k times}) = (ww . . .(\text{for k times}))^R.$ Set Theory & Algebra descriptive iitg-math discrete-mathematics + – dd asked Feb 22, 2017 dd 318 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Prashant. commented Feb 22, 2017 reply Follow Share For length 1 string w = a (aR)(aR)...(for k times)=(aa...(for k times))R For length 2 string w = ab (abR)(abR)...(for k times)=(abab...(for k times))R babababababab..ba = babababababa..ba so for string for length k (wR)(wR)...(for k times)=(ww...(for k times))R 0 votes 0 votes Akriti sood commented Feb 28, 2017 reply Follow Share @debashish..can you pls give any good links to see such proofs for discrete maths questions? 0 votes 0 votes Please log in or register to add a comment.