1,626 reputation
711
bio website
location Madrid, Spain
age 50
visits member for 3 years, 5 months
seen 8 hours ago

Mar
13
revised The number of symmetric polynomials of n degree
added 828 characters in body
Mar
13
awarded  Commentator
Mar
13
comment The number of symmetric polynomials of n degree
I don't understand what you mean by invariant, do you mean homogenous?, all the terms have the same total degree? take this four examples with $n=3$ and $k=2$, a) $x^3+y^3$, b) $x^2y + xy^2$, c) $x^3+y^3 + x + y$ d) $x^2y + xy^2+x+y$, which are you counting as degree 3?
Mar
13
answered The number of symmetric polynomials of n degree
Mar
11
comment Find maximum divisors of a number in range
PARI-GP is a great program to perform number theoretic calculations. The algorithm I've used is the same I have described, but PARI-GP knows how to handle big numbers and that makes everything easier.
Mar
11
revised Find maximum divisors of a number in range
added 317 characters in body; added 2 characters in body
Mar
11
answered Find maximum divisors of a number in range
Mar
8
comment Help complete a proof of Dirichlet on biquadratic character of 2?
2 is a biquadratic residue if and only if there is an $y$ with $y^4\equiv 2\pmod{p}$ if and only if $2^{(p-1)/4} \equiv (y^4)^{(p-1)/4} \equiv 1 \pmod{p}$ the last iif can be seen for example using a primitive root mod $p$.
Mar
7
answered Help complete a proof of Dirichlet on biquadratic character of 2?
Mar
7
revised Eisenstein series
added 476 characters in body
Mar
6
answered Eisenstein series
Mar
1
awarded  Enthusiast
Feb
16
comment Are limits on exponents in moduli possible?
To define limits in modular equations you need a topology, I think that what you are lookimg is $p$-adic analysis. But even with a proposition like $\lim x^{f(n)/g(N)} \ne y$ in $\mathbb{Q}_p$ (if that can be properly defined) for every $p$ I'm not sure if you could derive that $x^d \ne y$ in $\mathbb{R}$
Feb
15
answered Are limits on exponents in moduli possible?
Feb
5
comment Fast method for Nth Squarefree number (using mathematica)
I'm sorry, I had misunderstood the question. But you can use the same formula combined with a binary search. It will take only a few applications of the formula.
Feb
5
answered Fast method for Nth Squarefree number (using mathematica)
Feb
2
comment How many consecutive composite integers follow k!+1?
You might want to take a look to the OEIS sequence (oeis.org/A037153)
Jan
26
comment Approximating $\pi$ using Monte Carlo integration
could it be a typografic error? You have $$ \frac{\pi}{4} = \int_0^1 \sqrt{1-x^2} dx $$
Jan
25
comment Method to find $(x_1, x_2,…,x_n)$ s.t. polynom $p(x_1, x_2,…,x_n) \bmod m = 0$
A partial answer to the first question: If $m$ is prime and the number of variables $n$ is bigger than the degree of the polynomial $p$ then by Chevalley's Theorem the number of zeros is divisible by $p$. This might be useful if you already know a solution as in the case when there is no constant term.
Jan
10
awarded  Revival