(1) It is proved that Logan = logcnlogca (where a > 0, a ≠ 1, n > 0, C > 0, C ≠ 1). (2) let a and B be positive numbers not equal to 1, it is proved that loganbm = mnlogab (m ∈ R, & nbsp; n ∈ R, & nbsp; n ≠ 0)

(1) It is proved that Logan = logcnlogca (where a > 0, a ≠ 1, n > 0, C > 0, C ≠ 1). (2) let a and B be positive numbers not equal to 1, it is proved that loganbm = mnlogab (m ∈ R, & nbsp; n ∈ R, & nbsp; n ≠ 0)

It is proved that: (1) a > 0, a ≠ 1, n > 0, C > 0, C ≠ 1, let Logan = B, then AB = n, ∵ logcn = logcab = blogca, ∵ logcnlogca = blogcalogca = B, ∵ Logan = logcnlogca; (2) a and B are positive numbers which are not equal to 1