Reputation
315
Top tag
Next privilege 500 Rep.
Access review queues
Badges
2 13
Newest
 Revival
Impact
~3k people reached

  • 0 posts edited
  • 2 helpful flags
  • 22 votes cast
2h
comment Intuitive explanation why if $P$ is a subspace of linear space $L$, then $L/P$ is not a subspace of $L$
and why exactly these horizontal lines are not a subspace of L?
2h
comment Intuitive explanation why if $P$ is a subspace of linear space $L$, then $L/P$ is not a subspace of $L$
thank you, I am sure that you are correct, but it is not really an intuitive explanation for me.
2h
asked Intuitive explanation why if $P$ is a subspace of linear space $L$, then $L/P$ is not a subspace of $L$
22h
comment Let $P$ denote a subset of a linear space $L$, why does the set $P$ always contains a basis of $span\,P$.
ah, I got it. Surely it always contain the basis of span of P, but it does not mean it can not contain other things.
22h
accepted Let $P$ denote a subset of a linear space $L$, why does the set $P$ always contains a basis of $span\,P$.
22h
asked Let $P$ denote a subset of a linear space $L$, why does the set $P$ always contains a basis of $span\,P$.
22h
accepted Finding a linear map.
Apr
21
asked Finding a linear map.
Apr
21
accepted If $ f(n) = \sum_{i = 1}^{n} (n / i) \log(n / i) $ and $ g(n) = n ~ {\log^{2}}(n) $, then is $ O(f) = O(g) $?
Apr
20
revised If $ f(n) = \sum_{i = 1}^{n} (n / i) \log(n / i) $ and $ g(n) = n ~ {\log^{2}}(n) $, then is $ O(f) = O(g) $?
added 6 characters in body
Apr
20
comment If $ f(n) = \sum_{i = 1}^{n} (n / i) \log(n / i) $ and $ g(n) = n ~ {\log^{2}}(n) $, then is $ O(f) = O(g) $?
thank you. I really missed this part.
Apr
20
comment If $ f(n) = \sum_{i = 1}^{n} (n / i) \log(n / i) $ and $ g(n) = n ~ {\log^{2}}(n) $, then is $ O(f) = O(g) $?
Can you please explain this part: $f(n) =\sum_{i=1}^n \frac {n}i \ln\frac {n}i =n \ln n \sum_{i=1}^n \frac 1i -n \sum_{i=1}^n \frac {\ln i}i$ I am not sure I understand it.
Apr
20
asked If $ f(n) = \sum_{i = 1}^{n} (n / i) \log(n / i) $ and $ g(n) = n ~ {\log^{2}}(n) $, then is $ O(f) = O(g) $?
Apr
18
comment Find smallest discrete logarithm, knowing some discrete logarithm.
just to be sure: is ϕ(m) a totient function?
Apr
18
comment Find smallest discrete logarithm, knowing some discrete logarithm.
@HagenvonEitzen it would be nice to know this in any case, but actually $gcd(a, m) = 1$
Apr
18
asked Find smallest discrete logarithm, knowing some discrete logarithm.
Apr
15
asked Difference in Chebyshev inequality.
Apr
2
accepted Error in approximating the sum
Apr
2
accepted Simplify a sum of binomial
Mar
31
asked Error in approximating the sum