Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 4.1.5 (Compute $\nu_p(2\cdot 4 \cdot 6 \cdots (2n))$ and $\nu_p(1\cdot 3 \cdot 5 \cdots (2n+1))$.)

Exercise 4.1.5 (Compute $\nu_p(2\cdot 4 \cdot 6 \cdots (2n))$ and $\nu_p(1\cdot 3 \cdot 5 \cdots (2n+1))$.)

Find formulas for the highest exponent e of the prime p such that p e divides (a) the product 2 4 6 ( 2 n ) of the first n even numbers; (b) the product of the first n odd numbers.

Answers

Proof.

(a)
The product of the first n even numbers is P = 2 4 6 ( 2 n ) = 2 n n ! .

Using the de Polignac’s formula, we obtain

ν p ( P ) = { ν p ( n ! ) = i = 1 n p i if  p 2 , n + ν 2 ( n ! ) = n + i = 1 n 2 i if  p = 2 .

(b)
The product of the first n odd numbers is Q = 1 3 5 ( 2 n + 1 ) = ( 2 n + 1 ) ! 2 n n ! .

If p 2 ,

ν p ( Q ) = ν p ( ( 2 n + 1 ) ! ) ν p ( n ! ) = i = 1 ( 2 n + 1 p i n p i ) .

If p = 2 , since all factors in Q are odd,

ν 2 ( Q ) = 0 .

User profile picture
2024-12-12 09:41
Comments