Fixee
Reputation
5,873
Top tag
Next privilege 10,000 Rep.
Access moderator tools
 Dec30 accepted Derivation of $e$ Dec30 revised Derivation of $e$ added 75 characters in body Dec30 comment Derivation of $e$ @JonasMeyer: I think the way math evolved was to use some informal versions of infinite series without any rigorous notions of limits (see for example the Madhava series, used around 1400CE, en.wikipedia.org/wiki/Madhava_series). In any case, in my question I meant "how can we derive a method to calculate digits of $e$ from the definition of Bernoulli, but without resorting to the Taylor series". Dec29 asked Derivation of $e$ Dec28 revised question about derivative of exponential function deleted 4 characters in body Dec19 awarded Good Answer Dec10 comment Easy way to generate random numbers? Check out en.wikipedia.org/wiki/… (that's what you're trying to devise here). Dec9 comment Planar graphs & Spanning trees To even have red, blue, and green spanning trees, every node must have at least degree 3, but you can't have more than $3|V|-6$ edges. Nov22 awarded Pundit Nov22 comment How to explain that division by $0$ yields infinity to a 2nd grader @Marcus My kid came home talking about his friends having a competition about "who can name the biggest number". One said "infinity!" Another said "infinity + 1!" My kid said "infinity to the infinity!" I gave him a time-out for that. Infinity is not a number. Nov18 answered Language over $\{0,1\}$ Nov16 comment Possible values of $N$ @RossMillikan: He edited it: he had the condition "$(n+7)\ |\ 36m$ for integer $m$" as a condition. Nov16 comment How many chess games of a suspect does one have to analyze to have a reliable answer to the question whether the suspect cheats? Don't you get into trouble when there is a long sequence of exchanges? Then every move is obvious to a human and computer: would they be flagged as cheaters? Nov16 comment Careers in Math Well, you almost certainly won't fail to not be rich. Nov16 comment Possible values of $N$ I don't think this is right; for example $n=65$ satisfies your criterion, but not the equation required by the asker. Nov16 answered How many subsets does $S_{n+1}$ have? Nov4 comment Ensuring that a graph has odd number of hamiltonian paths I think if $G$ is undirected, and if we define a hamiltonian path as a permutation of the vertices, then there are always an even number of such permutations if the number of vertices > 1. Nov4 comment Ensuring that a graph has odd number of hamiltonian paths Is $G$ a digraph? Oct31 answered Relations between the maximum matching, minimum vertex cover, maximum independent set, and maximum vertex biclique for a bipartite graph Oct31 answered Cards and numbers