book Maths Puzzle Numerical Ability

Let p be prime. Prove that...

(1 + p)^(p^(n - 1)) = 1(mod p^n) for all n = 1, 2, 3,...

Would using the Binomial Thm help? What about applying the Chinese Remainder Thm?

Read Solution (Total 0)

book Other Question

Find real solutions. I just dont understand this one!

x^2+sqrt2x-2=0

Thank you!!
Divide and simplify

3x^2 +13x + 4 / 3x^2-5x-12
____________ ________________
16-x^2 3x-12