7,078 reputation
31856
bio website facebook.com/jdb1729
location Champaign, IL
age 36
visits member for 4 years, 3 months
seen Oct 12 at 5:43

Amateur mathematician, professional software engineer. Interested in all kinds of math, becoming a better mathematician, and helping others do the same.

email: jdb1729 (at) gmail.com


Oct
17
awarded  Popular Question
Oct
5
revised Does a random binary sequence almost always have a finite number of prime prefixes?
fix definition
Oct
5
reviewed Approve suggested edit on How do you simplify this boolean expression?
Oct
5
reviewed Approve suggested edit on problems with applying a $f(x)=x^2$ curve
Oct
5
revised Does a random binary sequence almost always have a finite number of prime prefixes?
wrap sets
Oct
5
asked Does a random binary sequence almost always have a finite number of prime prefixes?
Oct
4
reviewed Reopen Solve $ (u^n-v^n)=p(u-v)^2$
Oct
4
reviewed Reject suggested edit on Infinite product of probability measures is a premeasure
Oct
4
reviewed Approve suggested edit on sumset tag wiki excerpt
Oct
4
awarded  Benefactor
Oct
4
awarded  Nice Question
Oct
4
reviewed Approve suggested edit on If the first 3 flips of a fair coin are tails, what is the probability that the next flip will be heads?
Oct
2
reviewed Approve suggested edit on Difference in derivative between $\frac{6}{3x^2+1}$ and $\frac{6}{3x^2}$
Oct
2
comment Is there any infinite set of primes for which membership can be decided quickly?
Also I am assuming the input is encoded as a bit string.
Oct
2
comment Is there any infinite set of primes for which membership can be decided quickly?
This is awesome, although the algorithm is said to run in $\tilde{O}{(\log{n})^{16}}$ which is not as good as I am hoping for, I like to think that it is evidence that something faster than AKS for some infinite subset is not out of reach.
Oct
2
comment Is there any infinite set of primes for which membership can be decided quickly?
I am looking for a set with an infinite number of primes and only primes, for which there is a decision algorithm in for example $O((\log)^5)$. $k \cdot 2^n - 1$ numbers would work fine if we could prove there were an infinite number of them.
Sep
30
awarded  Explainer
Sep
27
reviewed Approve suggested edit on Intial conditions for second order differential equations using MATLAB
Sep
27
reviewed Approve suggested edit on Minimum number of moves to scramble a matrix
Sep
27
comment Is there any infinite set of primes for which membership can be decided quickly?
math.dartmouth.edu/~carlp/PDF/110.pdf