Reputation
Next tag badge:
366/400 score
265/80 answers
Badges
3 38 88
Impact
~297k people reached

1h
comment How to prove that series $\frac{1}{n+1}$, as $n\to \infty$ is zero.
Yeah, $\lim_{n\to\infty}\frac{n}{n+1}=1$ :)
1h
revised How to prove that series $\frac{1}{n+1}$, as $n\to \infty$ is zero.
edited body
2h
comment How to prove that series $\frac{1}{n+1}$, as $n\to \infty$ is zero.
Oh ok I got it. it should be an $i$ instead of an $n$. Thanks
2h
comment How to prove that series $\frac{1}{n+1}$, as $n\to \infty$ is zero.
$1/2+1/3+1/4+1/5+1/6>1$, I don't see how that claim is possible.
4h
revised How to prove that series $\frac{1}{n+1}$, as $n\to \infty$ is zero.
added 53 characters in body
4h
revised How to prove that series $\frac{1}{n+1}$, as $n\to \infty$ is zero.
added 53 characters in body
4h
answered How to prove that series $\frac{1}{n+1}$, as $n\to \infty$ is zero.
4h
comment How to prove that series $\frac{1}{n+1}$, as $n\to \infty$ is zero.
The series? so you are going to add them? or the sequence?
4h
comment How many surjective functions $f: X \to \{1,…,j\}$?
so $k!$ multiplied by the number of paritions of a set $X$ with $kj$ elements into $k$ equal parts
12h
answered What the difference between the smallest two numbers from these numbers?
1d
comment Find the smallest natural number $n$
Yeah, I got that now CiaPan, I think that's what it is.
1d
revised Find the smallest natural number $n$
added 32 characters in body
1d
revised Find the smallest natural number $n$
deleted 27 characters in body
1d
revised Find the smallest natural number $n$
edited body
2d
comment Does there exist a graph $G$ such that every edge is contained in a unique Hamiltonian circuit, that is not a cycle graph?
Now that I think about it if such a graph doesn't exist for two it doesn't exist for more so it is equivalent in that sense
2d
comment Does there exist a graph $G$ such that every edge is contained in a unique Hamiltonian circuit, that is not a cycle graph?
Henning, I don't see why there needs to be exactly two hamiltonian circuits, I do see however why all the hamiltonian circuits need to be disjoint and how the graph needs to be a disjoint union of hamiltonian circuits.
2d
comment Find all primes $a,b,c$ and integer $k$ satisfying the equation $a^2 + b^2 + 16 c^2 = 9k^2 +1$
since $152=2^3\cdot 19$ you have to separate it in $3k-a=1,2,4,8,$
2d
comment Find all primes $a,b,c$ and integer $k$ satisfying the equation $a^2 + b^2 + 16 c^2 = 9k^2 +1$
Yeah. $152=9k^2-a^2$
2d
comment Find all primes $a,b,c$ and integer $k$ satisfying the equation $a^2 + b^2 + 16 c^2 = 9k^2 +1$
you need also $a=c=3$., but good work. I'm sure you can use similar methods.
Jul
2
answered Proof that if a simple Graph contains at most two nodes with odd degree then it has a Euler walk