Primitive roots

Determine which elements of Z_7 (Z sub 7) are primitive roots.

Theory of Numbers : Principle of Mathematical Induction: Prove that 1^2 + 2^2 + 3^2 + … +n^2 = n(n+1)(2n + 1) / 6

Prove that 1^2 + 2^2 + 3^2 + … +n^2 = n(n+1)(2n + 1) / 6

Theory of Numbers : Principle of Mathematical Induction - Prove that 1^3 + 2^3 + 3^3 + … + n^3 = (1 + 2 + 3 + … + n)^2

Prove that 1^3 + 2^3 + 3^3 + … + n^3 = (1 + 2 + 3 + … + n)^2

Theory of Numbers : Principle of Mathematical Induction: Prove that x^n – y^n = (x – y)[ x^(n-1) + x^(n-2)y + … + xy^(n-2) + y^(n-1) ]

Prove that x^n – y^n = (x – y)[ x^(n-1) + x^(n-2)y + … + xy^(n-2) + y^(n-1) ]

Theory of Numbers (IV): Principle of Mathematical Induction

Theory of Numbers (IV) Principle of Mathematical Induction Prove that 1.2 + 2.3 + 3.4 + … + n( n + 1) = n( n + 1)( n + 2 )/3

Theory of Numbers (V): Principle of Mathematical Induction

Theory of Numbers (V) Principle of Mathematical Induction Prove that 1 + 3 + 5 + …+(2n – 1) = n^2

Theory of Numbers (VI): Principle of Mathematical Induction

Theory of Numbers (VI) Principle of Mathematical Induction Prove that 1/(1.2) + 1/(2.3) + 1/(3.4) + … + 1/{n.(n + 1)} = n/ ...continues

Theory of Numbers : Fibonacci Number

Suppose that F1 = 1, F2 = 1, F3 =1, F4 = 3, F5 = 5, and in general Fn = Fn-1 + Fn-2 for n ≥ 3 ( Fn is called the nth Fibonacci number.) Prove that F1 + F2 + F3 +…+ Fn = F(n + 2) – 1

Theory of Numbers (VIII): Principle of Mathematical Induction: Fibonacci Number

Theory of Numbers (VIII) Principle of Mathematical Induction Fibonacci Number Pro ...continues

Theory of Numbers (IX): Principle of Mathematical Induction:

Theory of Numbers (IX) Principle of Mathematical Induction Fibonacci Number Prove that ...continues