siegelzero

6 ms·

1.
by siegelzero 10mo ago
Very cool! There's definitely some similarity to Ramanujan Sums, though the approach here sort of packages the fizz-buzz divisibility properties into one function. https://en.wikipedia.org/wiki/Ramanujan%27s_sum
2.
by siegelzero 1y ago
Yes you're right it's typically stated as "shaves all those, and those only, who do not..." https://en.wikipedia.org/wiki/Barber_paradox
3.
by siegelzero 2y ago
I can recommend the book Guide to Graph Colouring: Algorithms and Applications by Lewis. It covers techniques including some state of the art methods for getting good but not provably optimal colorings. It discusses in depth local search an
4.
by siegelzero 3y ago
"Irresistible Integrals: Symbolics, Analysis and Experiments in the Evaluation of Integrals" - Boros and Moll "Inside Interesting Integrals" - Nahin
5.
by siegelzero 4y ago
https://archive.ph/39IUU
6.
by siegelzero 4y ago
Did you mean this site? It has some pretty great content. https://musicforprogramming.net/one
7.
by siegelzero 4y ago
https://web.archive.org/web/20220526162025/https://bartwrons...
8.
by siegelzero 6y ago
His article about bit manipulation is very nice, as well. https://catonmat.net/low-level-bit-hacks
9.
by siegelzero 6y ago
Penn State has a bunch of their graduate stats courses online [1]. I worked through some of their time series class [2] and found it to be pretty good quality. [1] https://online.stat.psu.edu/statprogram/ [2] https:&#
10.
by siegelzero 6y ago
And those who want to see trees go to r/marijuanaenthusiasts
11.
by siegelzero 7y ago
This paper was posted earlier with Anonymous authors: https://news.ycombinator.com/item?id=21084748
12.
by siegelzero 9y ago
There are some closely related difficult problems. Consider the fraction a/b, and let r be the length of the repeating fractional part. Then r <= b - 1. Moreover, if r == b - 1, then b is prime. In general, r divides phi(b), where p
13.
by siegelzero 9y ago
Check out the (official?) site to buy Wheel of Fortune/Jeopardy! tickets for some nostalgia: http://www.wheeljeopardytickets.com/
14.
by siegelzero 9y ago
I've solved 249 of them. I don't remember when I joined, but it must have been about 10 years ago. Solving PE problems was a great way to unwind in grad school (studying math) and learn some cool math in the process. There was a p
15.
by siegelzero 9y ago
Reminds me of bash roulette. http://www.bash.org/?96164
16.
New Ramsey number upper bound: $R(5, 5) \le 48$(arxiv.org)
1 points by siegelzero 9y ago|0 comments
17.
by siegelzero 10y ago
I was always fond of "presbyterians" "britneyspears".
18.
by siegelzero 10y ago
Yeah, this proof seems to work. I was thinking of the case where you attack $e^2$ directly, instead of going after both $e$ and $e^{-1}$.
19.
by siegelzero 10y ago
It's simply a habit from LaTeX :-)
20.
by siegelzero 10y ago
This a very terse proof. It is stated "The same method can also be used to prove that e cannot be a root of a second degree equation with rational coeﬃcients", but if I recall correctly, the generalization for the irrationality of
21.
by siegelzero 10y ago
It's a contradiction because there are no integers strictly between 0 and 1.
22.
by siegelzero 10y ago
That's not exactly true. Density arguments similar to this are fairly common in number theory (even if the arguments aren't rigorous). Granted, one has to be careful with arguments like this, but they can often be useful.
23.
by siegelzero 10y ago
Ono is the most self-promoting mathematician I've ever seen. He's done some outstanding work, but he certainly enjoys the spotlight.
24.
by siegelzero 10y ago
Most people currently studying for a Masters or PhD aren't "laymen".
25.
by siegelzero 11y ago
Multi-section most likely means that there are several different sections of the same course running simultaneously. In addition, there are probably different professors teaching these sections. I can understand part of the argument here -