1,055 reputation
1510
bio website
location
age
visits member for 2 years, 9 months
seen yesterday

Aug
14
comment Notations that are mnemonic outside of English
@detly but much less funny
Aug
14
awarded  Nice Answer
Aug
13
answered Notations that are mnemonic outside of English
Aug
13
comment Notations that are mnemonic outside of English
the Dutch "sokkel" means pedestal
Aug
5
comment Why must a function have to have even and odd parts
only caveat is that $f(x)$ and $f(-x)$ must be defined
May
30
comment Last digits of a power of 2
converting to binary or ternary will be a step backwards, it's a question about it's decimal representation
May
28
comment How prove this $\frac{\sqrt{2}}{2}-\frac{1}{15}<F\left(\frac{\pi}{2}\right)<\frac{\sqrt{2}}{2}$
I can reduce $F(\pi/2)$ to $\sum_{n=1}^{\infty}\dfrac{(-1)^n}{\sqrt{8n^3+2n}}$
May
24
comment Can we get just $3$ from $\pi$?
@kaz probably not..
May
9
comment How do you calculate the modulo of a really high number with a large power, with a really high mod number?
note that this work best is the modulo number is the composite of many small primes, if it is prime itself this won't work
May
8
awarded  Caucus
Apr
25
comment What would base $1$ be?
@gangqinlaohu unless you specify that 1 is represented by 2 tallies
Apr
25
comment What would base $1$ be?
@gangqinlaohu see the second quote block in this answer ;)
Apr
25
comment What would base $1$ be?
for representing 0 you can define a number to be represented by 1+itself symbols. so 0 would be | and 1 would be || etc.
Feb
22
awarded  Good Answer
Nov
14
comment Is this an open problem?
expand your base to 100 and the number divided by 99 (same principle there)
Oct
21
comment Is this binary operation commutative?
with $x=y*(y*x)$ the $x*y$ should be $(y*(y*x))*y$ essentially you proved $y*x=y*x$
Oct
13
comment Why not write $\sqrt{3}2$?
@ThomasAndrews there's also $x_2$ to confuse it with especially when you pronounce $x_2$ as "ecks two"
Oct
11
awarded  Yearling
Sep
29
comment Is the set of all valid C++ programs countably infinite?
valid c++ $\subset \Sigma^*$ and $\Sigma^*$ (all strings of alphabet $\Sigma$) is countably infinite,
Jul
14
comment Where's the problem in this equation? Resulting in $4 = 5$
you could try to solve the left and right side on each line and see where it starts to differ