Esteban Crespi
Reputation
2,116
Top tag
Next privilege 2,500 Rep.
Create tag synonyms
 Sep 24 comment Factorization in a Group @kyloc, I found the paper and it directly cover your case so I'm updating the answer. Sep 23 answered Factorization in a Group Sep 21 comment The most Efficient Algorithm for Factoring Polynomial Over Finite Field Why not? All the residues will be 256-bit numbers and all the polynomials will have less than $n$ terms, with $n$ the degree of $F$. I'm not sure if you can hope for anything faster. Sep 21 answered The most Efficient Algorithm for Factoring Polynomial Over Finite Field Jun 15 comment Is there any polynomial function $f$ such that If $\gcd(p,q)=1$ then $\gcd(f(p),f(q))=1$ for all such $p,q$? How about f(x) = x? May 5 comment Using gauss's lemma to find $(\frac{n}{p})$ (Legendre Symbol) Be careful, you have an error in the set: it is not $\{3,6,\dots,3\frac{p-1}{a}\}$ but $\{3,6,\dots,3\frac{p-1}{2}\}$ in this case it doesn't alter the result but it would for $a=5$ or bigger. Mar 3 comment Is $53$ expressible in this form? Ark I used PARI GP, the powers of 3 mod 117 are just 3,9,27,81 and the powers of 2 are 1, 2, 4, 8, 11, 16, 22, 32, 44, 59, 64, 88 so it is easy to check Mar 3 revised Is $53$ expressible in this form? added 551 characters in body Mar 3 answered Is $53$ expressible in this form? Feb 5 awarded Enlightened Feb 5 awarded Nice Answer Jan 3 answered Algorithm to find maximum possible value of the minimum expression in a list Dec 20 awarded Constituent Dec 16 awarded Caucus Dec 5 answered Upper limit for the Divisor function Nov 8 awarded Yearling Oct 21 comment Proof of \$p_n