Intereting Posts

Prove that $\binom {n}{k} = \frac {n!} {(n-k)!k!}$, viewed as a function of $k$, has maximum at $k=\lfloor n/2 \rfloor, \lceil n/2 \rceil$.
Proving that $(\forall\epsilon>0)(\exists n,k\in\mathbb{N})(|\frac{n}{k}-\pi|<\frac{\epsilon}{k})$
How to calculate the lens distortion coefficients with a known displacement vector field?
Show $GCD(a_1, a_2, a_3, \ldots , a_n)$ is the least positive integer that can be expressed in the form $a_1x_1+a_2x_2+ \ldots +a_nx_n$
True or False $A – C = B – C $ if and only if $A \cup C = B \cup C$
Flow of sum of non-commuting vector fields
Associated primes of a sum of modules
Alternating group $\operatorname{Alt}(n)$, $n>4$ has no subgroup of index less than $n$.
Check if $(\mathbb Z_7, \odot)$ is an abelian group, issue in finding inverse element
Higman group with 3 generators is trivial
differential equation : non-homogeneous solution, finding YP
Prove Bernoulli Function is Constant on Streamline
How to prove that nth differences of a sequence of nth powers would be a sequence of n!
What does the Axiom of Choice have to do with right inversibility?
What can be said if $A^2+B^2+2AB=0$ for some real $2\times2$ matrices $A$ and $B$?

I am trying to prove that

$$\prod_{d|n}{d}=n^\frac{d(n)}{2},$$

where $d(n)$ is the number of divisors of $n$.

My initial thought was to say let $\{d_i\}_{i=1}^k$ be the set of all divisors of $n$. This means that $d(n)=k$. But $d(n)=(\alpha_1+1)(\alpha_2+1)…(\alpha_m+1)$ when we define $n=p_1^{\alpha_1}p_2^{\alpha_2}…p_m^{\alpha_m}$. So $m<k$.

Now the divisors of $n$ are just the product of prime powers with some combination of the primes/prime powers removed. For example, a divisor, $d_i=\frac{n}{p_j^{\alpha_l}}$. The product of these divisors will yield $n^k$ in the numerator, and $n^i$ in the denominator with $i<k$ since the denominator will contain all $p_j^{\alpha_j}$. But how to show that it is exactly $n^\frac{d(n)}{2}$ is escaping me.

- Applications of cubic in number theory?
- Summation of a function 2
- Minimum of $n$? $123456789x^2 - 987654321y^2 =n$ ($x$,$y$ and $n$ are positive integers)
- What would be the immediate implications of a formula for prime numbers?
- Finding all possible values of a Function
- Prime elements in the gaussian integers

- Proving that any rational number can be represented as the sum of the cubes of three rational numbers
- sequence $\{a^{p^{n}}\}$ converges in the p-adic numbers.
- A conjecture about an unlimited path
- $n!+1$ being a perfect square
- $(a+b)^2+4ab$ and $a^2+b^2$ are both squares
- Geometric intuition for $\pi /4 = 1 - 1/3 + 1/5 - \cdots$?
- Do we really know the reliability of PrimeQ (for $n>10^{16}$)?
- Finding a cyclotomic field implied by Kronecker-Weber
- Number Theory: Ramification
- Integer solutions for $x^3+2=y^2$?

Let our product be $P$. Then

$$P=\prod_{d|n} d.$$

But we also have

$$P=\prod_{d|n} \frac{n}{d}.$$

Thus

$$P^2=\prod_{d|n} \left(d\cdot \frac{n}{d}\right)=\prod_{d|n} n=n^{d(n)}.$$

There is a much simpler way to solve this.

Let $S = \lbrace d\vert n, d \leq \sqrt{n}\rbrace$ and $S’ = \lbrace d\vert n, d >\sqrt{n}\rbrace$. Note that $S \cup S’$ is the set of all divisors of $n$ and that $S \cap S’ = \emptyset$.

So for every $d \in S$ we have a unique $d’ \in S’$ such that $dd’ = n$.

$$\prod_{d\vert n} d = \prod_{d\in S}d \prod_{d’\in S’}d’$$

So, if $n$ is not a perfect square, $S$ and $S’$ have the same amount of elements: $d(n)/2$. Therefore we can pair up the elements in $S$ and in $S’$ such that $d_kd’_k = n$.

$$\prod_{d\in S}d \prod_{d’\in S’}d’ = \prod_{d_k \in S, d’_k \in S’} d_kd’_k = n^{\vert S’\vert} = n^{d(n)/2}$$.

If $n$ is a perfect square, we can do the same pairing, but we will have an extra element in $S$ without a pair, that is precisely $\sqrt{n}$ so we would have:

$$\prod_{d\in S}d \prod_{d’\in S’}d’ = \sqrt{n}\prod_{d_k \in S, d’_k \in S’} d_kd’_k = \sqrt{n}n^{\vert S’\vert} = \sqrt{n}n^{[d(n)-1]/2} = n^{d(n)/2}$$

$\square$

- Whether the code produced by CRC is a cyclic code?
- Proving the Product Rule for exponents with the same base
- $K$ consecutive heads with a biased coin?
- If $R$ is commutative, and $J\lhd I\lhd R,$ does it follow that $J\lhd R?$
- Convergence of a compound sequence
- Number of $k^p \bmod q$ classes when $q\%p > 1$
- Ideas of finding counterexamples?
- How do you calculate that $\lim_{n \to \infty} \sum_{k=1}^{n} \frac {n}{n^2+k^2} = \frac{\pi}{4}$?
- Turing's 1939 paper on ordinal logic
- Showing that Y has a uniform distribution if Y=F(X) where F is the cdf of continuous X
- Priority vector and eigenvectors – AHP method
- Solve the recurrence $T(n) = 2T(n-1) + n$
- Cardinality of the set of all real functions which have a countable set of discontinuities
- What's the loop space of a circle?
- Monoid as a single object category