Mathematics
user avatar
user avatar
user avatar
user2566092
  • Member for 8 years, 10 months
  • Last seen more than 5 years ago
Profile Activity
Stats
25,657
reputation
1.2m
reached
1,222
answers
122
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
28
silver badges
61
bronze badges
Top tags
View all tags
171
Score
130
Posts
10
Posts %
168
Score
106
Posts
8
Posts %
158
Score
166
Posts
12
Posts %
150
Score
171
Posts
13
Posts %
143
Score
126
Posts
9
Posts %
106
Score
67
Posts
5
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
84
Is $\sqrt {2 \sqrt {3 \sqrt {4 \ldots}}}$ algebraic or transcendental?
Aug 15, 2014
question
48
Ways to make a series diverge "faster" to show divergence
Aug 25, 2013
answer
25
Limit $\frac{x^2y}{x^4+y^2}$ is found using polar coordinates but it is not supposed to exist.
Apr 14, 2014
answer
24
Is there anything wrong with this proposed proof of the irrationality of Euler's constant?
Aug 27, 2015
answer
24
Does the series $\sum_{n=1}^\infty \left|\frac{\cos2^n}{n}\right|$ converge or not?
Apr 17, 2014
question
17
Is Zorn's lemma necessary to show discontinuous $f\colon {\mathbb R} \to {\mathbb R}$ satisfying $f(x+y) = f(x) + f(y)$?
Sep 13, 2013
question
17
Does $\sum_n |\sin n|^{cn^2}$ converge?
Feb 9, 2015
answer
17
Checking connectivity of adjacency matrix
Jul 11, 2014
answer
17
How to sort vertices of a polygon in counter clockwise order?
Oct 17, 2014
answer
16
$0.00\dots 1=0$ claim
Aug 3, 2013
Top Meta posts
3
0
3
How can this naive question get upvotes?
Top network posts
View all network posts
33
How to efficiently compute average on the fly (moving average)?
21
Do functions with slower growth than inverse Ackermann appear in runtime bounds?
14
How much complexity difference can there be between finding a solution to a Sudoku puzzle and PROVING that the solution is the unique solution?
14
Algorithm for finding two smallest numbers in an array
13
Computing exact or asymptotics for number of strings over an alphabet of size $n$ that have no non-trivial substrings that appear more than once

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.