Show that if a = b (mod m) and ak+1 = bk+1 (mod m), where a, b, k, m € Z, k, m > 0, (a,m) = 1, then a = b (mod m). If the condition (a,m) = 1 is dropped, is the conclusion that a = b (mod m) still valid?