10,383 reputation
41657
bio website
location
age
visits member for 2 years, 9 months
seen 15 mins ago

I have a B.Sc in computer science and a B.Sc in mathematics from the Technion.

I am interested mainly in abstract algebra and I hope to start graduate school soon to continue study some advanced topics in this area.

Currently I am going over Abstract Algebra by Dummit and Foote to recall old topics and fill some gaps I have, while working full time as a programmer.


Sep
6
revised Calculate $g^2, g^3, f^2$
edited title
Sep
6
answered Calculate $g^2, g^3, f^2$
Sep
6
answered What does f(-5)=-2 tell me about f(x)
Sep
6
answered $n$th derivative of $e^{-x^2}$
Sep
6
revised If a matrix is non diagonalizable, what other method can I use to calculate the nth power?
added 1 character in body
Sep
6
comment Prove that $\lim_{x \to 0} f(x) = \lim_{x \to a } f(x-a)$
@VanioBegic - that is my first hint. If $x$ is delta close to zero then shifting it by $a$ makes it delta close to $a$
Sep
6
comment Prove that $\lim_{x \to 0} f(x) = \lim_{x \to a } f(x-a)$
@VanioBegic - right, I have made another edit, just changed $f(0)$ to some $L$
Sep
6
revised Prove that $\lim_{x \to 0} f(x) = \lim_{x \to a } f(x-a)$
added 23 characters in body
Sep
6
comment Prove that $\lim_{x \to 0} f(x) = \lim_{x \to a } f(x-a)$
@VanioBegic - I edited it out, I didn't use it
Sep
6
comment Prove that $\lim_{x \to 0} f(x) = \lim_{x \to a } f(x-a)$
@VanioBegic - see edit
Sep
6
revised Prove that $\lim_{x \to 0} f(x) = \lim_{x \to a } f(x-a)$
added 503 characters in body
Sep
6
answered Prove that $\lim_{x \to 0} f(x) = \lim_{x \to a } f(x-a)$
Sep
6
accepted Computing in Matlab, for a $n\times2$ matrix, for each row$\theta_{0}*\text{first element in row}+\theta_{1}*\text{second element in row}$
Sep
5
answered Definition Fixed Element
Sep
5
answered Check diagonalizability of a matrix without using eigen properties
Sep
4
comment Help with proof by induction
@David - There are many ways to solve recursion formulas . One way is with en.wikipedia.org/wiki/Master_theorem
Sep
4
comment Help with proof by induction
Its hard to read - but I'm referring to $2$ recursive calls to Hanoi plus the last call to move one disk
Sep
4
comment Help with proof by induction
@David - We denote the total number of transfers we have to make to solve the problem with $n$ disks $with $H_n$. From this code you see that to solve the problem with $n$ disk requires you to solve the problem with $n-1$ disks twice - this is the call to hanoi_move(n-1, from, other, to) and to hanoi_move(n-1, other, to, from) - Each of them takes, by definition, $H_{n-1}$ transfers, we also need to make one more transfer - which is the line - move one disk from the "from" peg to the "to" peg
Sep
4
comment Help with proof by induction
@David - Try pasting the code to lpaste.net its hard to read it from your comment
Sep
4
comment Nullspace and Base of 2 by 2 Matrix
Do you know the definitions of "the nullspace(f), the base of nullspace(f) & image(f)" ? Where are you stuck ?