› personal › pborwein › PAPERS › P29.pdf · The order in (5) is independent of both n and i. Thus, the complexity of computing all the ßl is O(log n) = O(logn M(n)) = log

Page 1 <img data-url='document/a-personal-a-pborwein-a-papers-a-p29pdf-the-order-in-5-is-independent.html?page=1' data-page='1' class='cut-thumb lazyload' alt='Page 1: › personal › pborwein › PAPERS › P29.pdf · The order in (5) is independent of both n and i. Thus, the complexity of computing all the ßl is O(log n) = O(logn M(n)) = log' loading='lazy' src='data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==' data-src='https://reader033.cupdf.com/reader033/viewer/2022053011/5f0eadaa7e708231d4406666/html5/thumbnails/1.jpg' width='140' height='200' /> Page 2 <img data-url='document/a-personal-a-pborwein-a-papers-a-p29pdf-the-order-in-5-is-independent.html?page=2' data-page='2' class='cut-thumb lazyload' alt='Page 2: › personal › pborwein › PAPERS › P29.pdf · The order in (5) is independent of both n and i. Thus, the complexity of computing all the ßl is O(log n) = O(logn M(n)) = log' loading='lazy' src='data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==' data-src='https://reader033.cupdf.com/reader033/viewer/2022053011/5f0eadaa7e708231d4406666/html5/thumbnails/2.jpg' width='140' height='200' /> Page 3 <img data-url='document/a-personal-a-pborwein-a-papers-a-p29pdf-the-order-in-5-is-independent.html?page=3' data-page='3' class='cut-thumb lazyload' alt='Page 3: › personal › pborwein › PAPERS › P29.pdf · The order in (5) is independent of both n and i. Thus, the complexity of computing all the ßl is O(log n) = O(logn M(n)) = log' loading='lazy' src='data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==' data-src='https://reader033.cupdf.com/reader033/viewer/2022053011/5f0eadaa7e708231d4406666/html5/thumbnails/3.jpg' width='140' height='200' /> Page 4 <img data-url='document/a-personal-a-pborwein-a-papers-a-p29pdf-the-order-in-5-is-independent.html?page=4' data-page='4' class='cut-thumb lazyload' alt='Page 4: › personal › pborwein › PAPERS › P29.pdf · The order in (5) is independent of both n and i. Thus, the complexity of computing all the ßl is O(log n) = O(logn M(n)) = log' loading='lazy' src='data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==' data-src='https://reader033.cupdf.com/reader033/viewer/2022053011/5f0eadaa7e708231d4406666/html5/thumbnails/4.jpg' width='140' height='200' /> Page 5 <img data-url='document/a-personal-a-pborwein-a-papers-a-p29pdf-the-order-in-5-is-independent.html?page=5' data-page='5' class='cut-thumb lazyload' alt='Page 5: › personal › pborwein › PAPERS › P29.pdf · The order in (5) is independent of both n and i. Thus, the complexity of computing all the ßl is O(log n) = O(logn M(n)) = log' loading='lazy' src='data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==' data-src='https://reader033.cupdf.com/reader033/viewer/2022053011/5f0eadaa7e708231d4406666/html5/thumbnails/5.jpg' width='140' height='200' />

› personal › pborwein › PAPERS › P29.pdf · The order in (5) is independent of both n and i. Thus, the complexity of computing all the ßl is O(log n) = O(logn M(n)) = log

Documents