Timeline for Computational number theory
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 7, 2016 at 14:23 | comment | added | shamym shamim | I cant understand what is relation between $\epsilon^{s_t}=\epsilon^{2s_i+s_j}$ and gcd$(x^q-1,(2x+1)^q-1)=x+1$ ? | |
| Jun 28, 2016 at 0:12 | comment | added | Michael Zieve | @Joe: I think your article isn't relevant, due to the condition $q<(p-1)/q$ in the current question. | |
| Jun 27, 2016 at 12:41 | comment | added | Joe Silverman | @MichaelZieve Not sure if it's relevant, but apropos $\gcd\bigl(f(x)^n-1,g(x)^n-1\bigr)$ in $\mathbb F_p[x]$, there's my article Common divisors of $a^n-1$ and $b^n-1$ over function fields, New York Journal of Math. 10 (2004), 37-43. | |
| Jun 27, 2016 at 11:40 | comment | added | shamym shamim | Can we certain $i,t$, such that $\epsilon^{s_t}=\epsilon^{2s_i+s_j}$? | |
| Jun 24, 2016 at 13:32 | comment | added | Michael Zieve | Counterexample: $p=239$, $q=14$, $s_j=1$. Then $(s_i,s_t)$ can be $(-1,-1)$ or $(100,201)$ or $(141,44)$. I note that the problem can be reformulated as asking whether $\text{gcd}(x^q-1,(2x+1)^q-1)=x+1$ in $\mathbf{F}_p[x]$. | |
| Jun 24, 2016 at 10:29 | history | edited | shamym shamim | CC BY-SA 3.0 |
edited body
|
| Jun 24, 2016 at 8:57 | review | First posts | |||
| Jun 24, 2016 at 9:16 | |||||
| Jun 24, 2016 at 8:54 | history | asked | shamym shamim | CC BY-SA 3.0 |