1,951 reputation
317
bio website
location
age
visits member for 1 year, 11 months
seen Sep 10 at 3:09

Sep
13
awarded  Good Question
Sep
10
answered Proving $n^q$ is algebraic when $n\in \mathbb N$ and $q\in \mathbb Q$.
Jul
2
awarded  Curious
Jul
2
awarded  Inquisitive
Jun
5
awarded  Nice Question
Apr
19
awarded  Nice Question
Mar
10
awarded  Self-Learner
Dec
26
awarded  Nice Question
Dec
19
awarded  Disciplined
Dec
17
reviewed Reject suggested edit on Minimizing the distance between points in two sets
Dec
17
asked Minimizing the distance between points in two sets
Dec
11
accepted Show that for $0<t<1$, $\log\sin (t\pi)=\log(t\pi) + \sum_{n=1}^\infty\log\left(1-\frac{t^2}{n^2}\right)$
Dec
10
comment Show that for $0<t<1$, $\log\sin (t\pi)=\log(t\pi) + \sum_{n=1}^\infty\log\left(1-\frac{t^2}{n^2}\right)$
That's cool. By the way, how I should justify integrating term by term in the infinite series? Thanks.
Dec
9
asked Show that for $0<t<1$, $\log\sin (t\pi)=\log(t\pi) + \sum_{n=1}^\infty\log\left(1-\frac{t^2}{n^2}\right)$
Dec
7
accepted Let $a_k=\frac1{\binom{n}k}$, $b_k=2^{k-n}$. Compute $\sum_{k=1}^n\frac{a_k-b_k}k$
Dec
7
accepted 2 is a primitive root mod $3^h$ for any positive integer $h$
Dec
5
comment 2 is a primitive root mod $3^h$ for any positive integer $h$
Yeah that's why they said in the link, but I didn't find a proof of it.
Dec
5
asked 2 is a primitive root mod $3^h$ for any positive integer $h$
Dec
5
comment Let $a_k=\frac1{\binom{n}k}$, $b_k=2^{k-n}$. Compute $\sum_{k=1}^n\frac{a_k-b_k}k$
\left( and \right)
Dec
5
asked Let $a_k=\frac1{\binom{n}k}$, $b_k=2^{k-n}$. Compute $\sum_{k=1}^n\frac{a_k-b_k}k$