Thread: number of divisers of element in UFD

1. number of divisers of element in UFD

Hello;
I need your help is proving this statement;

Let R be a unique factorization domain and let a be non zero element of R with a=p_1^(α1)p_2^(α2)...P_n^(αn ), where pi are prime elements and αi are positive integers. Show that the number of divisors of a is the product of (1+αi ) where i=1,2,...,n

May be we can proceed by induction, but how can we start.

2. Originally Posted by student2011
Hello;
I need your help is proving this statement;

Let R be a unique factorization domain and let a be non zero element of R with a=p_1^(α1)p_2^(α2)...P_n^(αn ), where pi are prime elements and αi are positive integers. Show that the number of divisors of a is the product of (1+αi ) where i=1,2,...,n

May be we can proceed by induction, but how can we start.

Exactly, by induction: if there's only one prime in the decomposition of $\displaystyle a=p^a$ , then is divisors are

$\displaystyle 1,\,p,\,p^2,\,\ldots,\,p^\alpha$ ,and thus $\displaystyle \alpha +1$ divisors. Continue from here.

Tonio

3. Thaaaaaank you very much for your help. I will show you my solution:
So we use induction on the number of prime numbers appears in $\displaystyle a$;
If we have only one prime, then $\displaystyle a_1=p_1^{\alpha_1}$ and the divisors of $\displaystyle a_1$ are $\displaystyle 1,p_1,p_1^{2},....,p_1^{\alpha_1}$. Hence the number of divisors of $\displaystyle a_1$ is $\displaystyle 1+\alpha_1$.

Inductive Step: Suppose that $\displaystyle a_{n-1}$ contains $\displaystyle n-1$ prime numbers, and the statement is true for $\displaystyle a_{n-1}$. i.e $\displaystyle a_{n-1}=p_1^{\alpha_1}p_2^{\alpha_2}....p_{n-1}^{\alpha_{n-1}}$and the number of divisors of $\displaystyle a_{n-1}$ is $\displaystyle \prod_{i=1}^{n-1}{1+\alpha_i}$

Our goal is to show that the statement is true for $\displaystyle a_n$ which contain $\displaystyle n$ prime numbers.

We have $\displaystyle a_n=p_1^{\alpha_1}p_2^{\alpha_2}....p_{n-1}^{\alpha_{n-1}}.p_n^{\alpha_n}$. Hence $\displaystyle a_n=a_{n-1}.p_n^{\alpha_n}$ By inductive hypothesis, the number of divisors of $\displaystyle a_{n-1}$ is $\displaystyle \prod_{i=1}^{n-1}{1+\alpha_i}$ and we know that the number of divisors of $\displaystyle p_n^{\alpha_n}$ is $\displaystyle 1+\alpha_n$. So, the number of divisors of $\displaystyle a_n$ is $\displaystyle \prod_{i=1}^{n-1}{1+\alpha_i}.(1+\alpha_n)$ which is $\displaystyle \prod_{i=1}^{n}{1+\alpha_i$
This is my solution. If there is any mistakes or comments please guide me. Thank you again

4. Originally Posted by student2011
Thaaaaaank you very much for your help. I will show you my solution:
So we use induction on the number of prime numbers appears in $\displaystyle a$;
If we have only one prime, then $\displaystyle a_1=p_1^{\alpha_1}$ and the divisors of $\displaystyle a_1$ are $\displaystyle 1,p_1,p_1^{2},....,p_1^{\alpha_1}$. Hence the number of divisors of $\displaystyle a_1$ is $\displaystyle 1+\alpha_1$.

Inductive Step: Suppose that $\displaystyle a_{n-1}$ contains $\displaystyle n-1$ prime numbers, and the statement is true for $\displaystyle a_{n-1}$. i.e $\displaystyle a_{n-1}=p_1^{\alpha_1}p_2^{\alpha_2}....p_{n-1}^{\alpha_{n-1}}$and the number of divisors of $\displaystyle a_{n-1}$ is $\displaystyle \prod_{i=1}^{n-1}{1+\alpha_i}$

Our goal is to show that the statement is true for $\displaystyle a_n$ which contain $\displaystyle n$ prime numbers.

We have $\displaystyle a_n=p_1^{\alpha_1}p_2^{\alpha_2}....p_{n-1}^{\alpha_{n-1}}.p_n^{\alpha_n}$. Hence $\displaystyle a_n=a_{n-1}.p_n^{\alpha_n}$ By inductive hypothesis, the number of divisors of $\displaystyle a_{n-1}$ is $\displaystyle \prod_{i=1}^{n-1}{1+\alpha_i}$ and we know that the number of divisors of $\displaystyle p_n^{\alpha_n}$ is $\displaystyle 1+\alpha_n$. So, the number of divisors of $\displaystyle a_n$ is $\displaystyle \prod_{i=1}^{n-1}{1+\alpha_i}.(1+\alpha_n)$ which is $\displaystyle \prod_{i=1}^{n}{1+\alpha_i$
This is my solution. If there is any mistakes or comments please guide me. Thank you again

Nice. Just put parentheses after the Pi product sign: $\displaystyle \displaystyle{\prod\limits^n_{i=1}(\alpha_i + 1)$ .

Tonio