1,437 reputation
823
bio website about:blank
location Berlin, Germany
age 19
visits member for 3 years, 3 months
seen yesterday

I'm a highschool student from Germany interested in functional programming, especially Haskell.


Oct
8
comment Simplifier Tool for Windows
Actually that's only true if you assume that $a\neq0$.
Oct
6
comment What types of functions do recurrence relations methods apply to?
This seems to be a typical recurrence relation. Concrete Mathematics has a good chapter about it, if you are interested.
Oct
6
comment Why are variables lowercased?
@Olivier oops... I forgot that $\mathbb N$ is not a field. You may use $\mathbb C$ as another example.
Oct
6
comment Why are variables lowercased?
You may also consider fields; they are usually denoted by double-struck capitals, like $\mathbb N$, $\mathbb Q$ and $\mathbb F_2$.
Oct
4
accepted How many solutions does an equation system with binary values have?
Oct
4
comment How many solutions does an equation system with binary values have?
Thank you. That was a missconception of mine. I thought that the echelon form would allow constructs like above.
Oct
4
comment How many solutions does an equation system with binary values have?
What if a row is not completely zero, just the coefficient $a_{k,k}$ is? In this case, it depends on how you set the free variables, whether the equation in row $k$ becomes $0=0$ or $0=1$... I don't know how to prevent that. If the row is full of zeroes, it is easy. Consider this system: $$\begin{array}{cccc|c}1&1&0&0&1\\0&0&1&0&1\\0&0&1&1&1\\0&0&0&0&0\\\end{array}$$ If you set the rightmost variable to $1$, it has no solutions. How to deal with such a case?
Oct
4
asked How many solutions does an equation system with binary values have?
Sep
29
comment Fastest prime generating algorithm
You can't generate all prime numbers nor an infinite subset of all prime numbers in finite time...
Sep
25
answered How do I do this math right?
Sep
22
comment Proof that $a\equiv 1\,(\textrm{mod }8)$ implies $a$ is a square modulo $2^n$ for all $n$
Ah! I missunderstood. Thank you.
Sep
22
comment Proof that $a\equiv 1\,(\textrm{mod }8)$ implies $a$ is a square modulo $2^n$ for all $n$
$a=17, n=5.\ a\equiv17\mod2^5,$ but 17 is not a square... or didn't I understand your statement?
Sep
22
comment Easy proof, that $\rm e\notin \mathbb Q$
Thanks for the explanation.
Sep
22
comment Easy proof, that $\rm e\notin \mathbb Q$
The last step in the second line is not completely clear to me. Could you please elaborate why this holds?
Sep
21
accepted Is there an algorithm to find the roots of high-order polynomials?
Sep
21
comment Easy proof, that $\rm e\notin \mathbb Q$
@lhf Thank you for the interesting link.
Sep
21
accepted Reducing the time to calculate Collatz sequences
Sep
21
comment Easy proof, that $\rm e\notin \mathbb Q$
@francis-jamet We showed that the limit exists just as Srivatsan described.
Sep
21
awarded  Nice Question
Sep
21
comment Easy proof, that $\rm e\notin \mathbb Q$
@SrivatsanNarayanan Thank you! By the way, is it clear, which proof I refer to?