2,040 reputation
1625
bio website
location
age
visits member for 4 years, 10 months
seen 13 hours ago

2d
comment Counting number of primorial factors
$2^{n/log_2n}<2^n/2$ if $n>4$.
2d
reviewed Approve Decidability of matrix algebra
2d
reviewed Approve Algorithmic decidability of equality in the ring of periods
Sep
1
reviewed Approve Laplace-Beltrami and averaging
Sep
1
reviewed Reject and Edit What is $\sum (x+\mathbb{Z})^{-2}$?
Sep
1
revised What is $\sum (x+\mathbb{Z})^{-2}$?
deleted 1 character in body
Aug
27
reviewed Approve How to find $B$ by solving the following linear system: $s_k$ $B$ ${s_k}^T$ $=1,$
Aug
26
comment A variant frobenius problem
I think even that is difficult and that is itself an interesting case.
Aug
26
comment A question on representation of graphs
Do you have time to post update?
Aug
21
reviewed Approve How should a mathematician approach the physics literature concerning percolation?
Aug
21
comment Area defined with $\pm$ closedness
@ThomasBloom No wonder I was getting nothing.
Aug
21
comment Area defined with $\pm$ closedness
@ThomasBloom I do not know BM inequality. Does it?
Aug
21
comment On Pell's equation
do you know answer to 1,2?
Aug
21
comment Incidence geometry and matrices
So this does not work either?
Aug
20
comment Quadratic Diophantine equation in $\mathbb Z[T]$
Did anyone test this answer? by plugging in numbers?
Aug
20
revised Area defined with $\pm$ closedness
edited tags
Aug
20
revised A variant frobenius problem
added 6 characters in body
Aug
20
comment On Pell's equation
corrected positivity. you are right $D<0$ in $(3)$ seems difficult even at $m=1$ and probably hopeless at general $m$.
Aug
20
revised On Pell's equation
added 22 characters in body
Aug
20
comment On Pell's equation
interesting! $1.$ Could you post as full answer? I did not know this. $2.$ Also supposing factoring is easy would it affect efficiency here?