Timeline for $\omega(p^n - 1)$ as $n \rightarrow \infty$
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 27, 2013 at 21:38 | comment | added | fedja | Yes to "effectively computable". The pdf link is in one of the last posts in the linked thread (the most recent version). As to better bounds and factors, I have to think a bit :). | |
| Aug 27, 2013 at 16:46 | comment | added | The Masked Avenger | Can we say further that $n_0 \lt q$ and also from LTE one has $v_q(p^n - 1) \leq C(p,q) + v_q(n/n_0)$? Also, can one do better upper bounds with $C(p,q)$ than $C(p,q) \lt n_0 \log(p)/\log(q)$? | |
| Aug 27, 2013 at 16:38 | comment | added | The Masked Avenger | Also, I would appreciate your take on my linked question on counting factors (see sidebar). Are there AoPS problems which take (something like) the approach suggested there? | |
| Aug 27, 2013 at 16:31 | comment | added | The Masked Avenger | Thank you for looking at this. For sake of clarity, please confirm or deny the statement "C(p,q) is a value that depends only on p and q, and is just a uniformly effectively computable constant in p and q." (I've seen stuff where C returns a function and not a number.) Also, I am not finding a link to the PDF in the first post of your linked thread. Do you have a URL for the PDF? | |
| Aug 27, 2013 at 13:56 | history | answered | fedja | CC BY-SA 3.0 |