Help : Deriving an inequality
3 Attachment(s)
Hi, I am studying a paper by Yann Bugeaud ([URL="http://irma.math.unistra.fr/~bugeaud/travaux/ConfMumbaidef.pdf"]click here[/URL]), on page 13 there is an inequality (16) as given below image
[IMG]https://www.mersenneforum.org/attachment.php?attachmentid=20857&stc=1&d=1565055006[/IMG] which is obtained from the below image file  [IMG]https://www.mersenneforum.org/attachment.php?attachmentid=20858&stc=1&d=1565055006[/IMG] , on page 12. How the inequality (16) is derived? I couldn't figure it out. However one of my forum member tried but it has two problems (problems are marked as "how?"), it is given in below image [IMG]https://www.mersenneforum.org/attachment.php?attachmentid=20859&stc=1&d=1565055006[/IMG] It is not clear how those two questions would be resolved. Can any one show the derivation of inequality (16)? Thanks in Advance. 
So, you didn't find help over here:
[url]https://www.freemathhelp.com/forum/threads/helpderivinganinequalityrelatedtolucassequence.117311/[/url] Since the post is identical except the image attachments it looks like you copied and pasted. Can you give us some more background? 
No I did not get any help from there, you can find all detail in page 12 an 13 of the paper, not much detail is given.

The symbol [tex]\ll[/tex] isn't just an inequality symbol. In analytic number theory, if f and g are functions of one variable (in particular, a positive integer variable)
[tex]f(x)\;\ll\;g(x)[/tex] indicates that there is a (positive) constant k such that [tex]f(n) \;\le\; k\cdot g(n)[/tex] for sufficiently large n. The notation is due to Vinogradov. 
All times are UTC. The time now is 21:20. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2020, Jelsoft Enterprises Ltd.