The two recurrence relations
Open answerShow that for every n ≥ 1: J(2n) = 2·J(n) − 1 and J(2n + 1) = 2·J(n) + 1. (Question III.2 of the assignment.)
Show that for every n ≥ 1: J(2n) = 2·J(n) − 1 and J(2n + 1) = 2·J(n) + 1. (Question III.2 of the assignment.)