Comments for a. w. walker

Comment on Prime-Generating Polynomials by Alexandre le Savant

Alexandre le Savant — Wed, 28 Jan 2026 16:12:10 +0000

yeah go for it, sorry i am late by 7y

Comment on The Philosophy of Square-Root Cancellation by The Square Root Cancellation Heuristic | George Shakan

The Square Root Cancellation Heuristic | George Shakan — Tue, 01 Aug 2023 23:21:14 +0000

[…] and turns out to be very well-studied concept in several areas of mathematics (see this post for Number Theory or this post for […]

LikeLike

Comment on Two Classic Problems in Point-Counting by Gerald C

Gerald C — Sat, 01 Jul 2023 16:37:05 +0000

Lovedd reading this thank you

LikeLike

Comment on Formal Groups and Where to Find Them by Classify all solutions to $f(x+y) g(xy) = f(x) + f(y)$ – Mathematics – Forum

Thu, 12 Jan 2023 00:23:16 +0000

[…] All of this is summarized and presented with more context in MSE's very own Alex Walker's excellent blog post, Formal Groups and Where to Find Them. […]

LikeLike

Comment on Prime-Generating Polynomials by Oscar Lanzi

Oscar Lanzi — Mon, 18 Apr 2022 21:08:26 +0000

Your list of n²+n+41 primes gives 609 for n=39. But the true value at that value if n is 1601 (which us prime).

LikeLike

Comment on The Orders of Simple Groups by Andrew Baker

Andrew Baker — Sun, 09 Jan 2022 11:52:07 +0000

In the Proof of Theorem 2, I think the inequalities should read $P\leqslant Z(C_G(P))=Z(N_G(P))$.

LikeLike

Comment on The Forgotten Method of Prosthaphaeresis by Shubham Kumar

Shubham Kumar — Sat, 18 Dec 2021 19:37:33 +0000

Very nice article, very informative.

LikeLike

Comment on A Proof of Stirling’s Approximation via Contour Integration by Jean S

Jean S — Tue, 19 Oct 2021 00:52:54 +0000

I enjoyed readding this

LikeLike

Comment on Prime-Generating Polynomials by Cooper Gates

Cooper Gates — Tue, 01 May 2018 23:18:16 +0000

Nice proof that polynomials of degree > 1 can have arbitrarily long prime streaks.

It reminds me of choosing k ordered pairs. There must exist a polynomial with degree no greater than k – 1 that intersects all k points.
For instance, (0, 41), (1, 43), (2, 47), and so on through 150 consecutive primes can be fit with a polynomial of degree 149 or lower.

The trouble with this concept is that the polynomial’s degree keeps growing. How many primes can it find besides the primes already known to define it with?

Thus the Bouniakowsky conjecture comes up again. I limit my searching algorithms to degrees not exceeding ten, because I prefer
f(n) for 0<=n Is that a good strategy, or should I use higher degrees more?

LikeLike

Comment on Sums of Squares and Density by Alex

Alex — Sat, 20 Jan 2018 13:11:20 +0000

I am now not positive where you are getting your information, but good topic. I needs to spend a while finding out more or figuring out more. Thank you for fantastic info I was looking for this info for my mission.

LikeLike