Reputation
Next privilege 250 Rep.
View close votes
Badges
5
Newest
 Teacher
Impact
~288 people reached

  • 0 posts edited
  • 0 helpful flags
  • 11 votes cast
Sep
22
awarded  Teacher
Sep
21
comment In classical logic, why is $(p\Rightarrow q)$ True if both $p$ and $q$ are False?
I like the example I read somewhere long time ago: If you score 90% or above on the exam, then you will get an A. As a promise: You are guaranteed an A, provided you got 90% or above. -- 90% & you got A - promise kept. (implication is true); -- 90% & you got B - promise is broken (implication is false); -- less than 90% and got B - promise was not broken (implication is true); -- less than 90 and got A -- promise was not broken (implication is true).
Sep
21
awarded  Scholar
Sep
21
accepted Asymptotics of $nT(1) + \frac{n}{\lg5}\sum_{i=1}^{\log_5 n}\frac{1}{i}$
Sep
21
accepted Asymptotic of $T(n) = T(n-2) + \frac{1}{ \lg n}$
Sep
19
revised Subtracting lower-order term to prove subtitution method works
added 3 characters in body
Sep
19
asked Subtracting lower-order term to prove subtitution method works
Sep
12
awarded  Editor
Sep
12
revised Asymptotic of $T(n) = T(n-2) + \frac{1}{ \lg n}$
added 25 characters in body
Sep
12
comment Asymptotic of $T(n) = T(n-2) + \frac{1}{ \lg n}$
@RodCarvalho It is log base 2 (binary log)
Sep
12
awarded  Supporter
Sep
12
asked Asymptotic of $T(n) = T(n-2) + \frac{1}{ \lg n}$
Sep
11
comment Asymptotics of $nT(1) + \frac{n}{\lg5}\sum_{i=1}^{\log_5 n}\frac{1}{i}$
You would mind pointing me to the example, I can't seems to find it. Thanks
Sep
11
awarded  Student
Sep
11
asked Asymptotics of $nT(1) + \frac{n}{\lg5}\sum_{i=1}^{\log_5 n}\frac{1}{i}$