meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 2 years, 8 months |
| seen | yesterday | |
| stats | profile views | 55 |
|
May 12 |
awarded | Nice Answer |
|
May 4 |
comment |
A “simple” 3rd grade problem…or is it? You should all know that in these kind of tests, picture is not drawn to scale. That image is actually an image of a board drawn with altered scale to fool students that trued using rulers to get the answer. |
|
Apr 25 |
answered | How to entertain a crowd with mathematics? |
|
Mar 8 |
answered | Comparing $2013!$ and $1007^{2013}$ |
|
Feb 18 |
comment |
Where are the values of the sine function coming from? @JackM: I don't think the sin is the only solution that that differential equation. Case in point, $f(x) = 0$, $f'(x) = 0$, $f''(x) = 0$, and $-f''(x) = 0$ is also $f = -f''$. It would not be a good way to define a function. |
|
Jan 18 |
answered | Can you provide me historical examples of pure mathematics becoming “useful”? |
|
Jan 7 |
revised |
Formalizing the idea of “algorithm” added 72 characters in body |
|
Jan 7 |
awarded | Revival |
|
Jan 7 |
answered | Formalizing the idea of “algorithm” |
|
Jan 7 |
comment |
Formalizing the idea of “algorithm” In most formal definitions of algorithm must always have a "terminating condition", i.e. a condition that when reached will mark the end of the algorithm, e.g. when a certain character is found in the sequence (e.g. EOF or your α). A sequence of steps that does not have a terminating condition is usually called computational method/computational process. |
|
Dec 12 |
comment |
Does multiplying polynomials ever decrease the number of terms? If you meant by number of terms as degree, then no, multiplying polynomials would never decrease the degree of the resulting polynomial. If you meant by number of terms as in the number of non-zero coefficients, then others have given examples where it does happen. |
|
Nov 26 |
comment |
Can every proof by contradiction also be shown without contradiction? I usually see the proof stated as the following: Suppose there is only a finite number of primes and ALLPRIME contains all primes in existence. Then ... proof that there exist another number p which is a prime but not in ALLPRIME ... This is a contradiction so there are infinitely many primes. which is a proof by contradiction. I've never seen it presented the way you present it. |
|
Sep 27 |
awarded | Yearling |
|
Sep 23 |
comment |
How is $e^x$ read aloud? Grammar nazis? In real life? Would never had suspected it. Anyway, I generally avoid talking about math without a pen and paper, or a whiteboard; that way everybody understood even if you mispronounced x + 2 as "eks bi tu". |
|
Sep 22 |
comment |
How should “7 $\log_{10}$” be interpreted? could this perhaps be better asked on Seasoned Advice/Cooking.SE? |
|
Jul 6 |
comment |
Is '10' a magical number or I am missing something? simply put, 10 is special because it's the lowest two-digit integer in any base. |
|
Jun 8 |
awarded | Caucus |
|
Jun 2 |
comment |
How can we produce another geek clock with a different pair of numbers? I guess the next question is, to find the set of all 2-tuples where this clock has a solution. Also, find a minimal set of operations that would make any (n,k) pair of naturals to have a solution. |
|
May 15 |
awarded | Nice Question |
|
Apr 29 |
revised |
How to differentiate $x+\sqrt{1-x^2}$ added 372 characters in body |
