MySQL Web Server, Tomcat, Jsp, Struts Hosting Blog

460 ARITHMETIC 4.6.3 As an example of an lo-chain (certainly not a minimum one), consider 1 2 4 5,&10,12,l8; -, -, -, (51) it is easy to verify that the difference between each element and the previous underlined element is in the chain. We let lo(n) denote the minimum length of an IO-chain for n. Clearly l(n) 5 1 (n) 5 l*(n). The chain constructed in Theorem F is an lo-chain (see exercise 22); hence we have lo(n) < 1*( n ) f or certain n. It is not known whether or not l(n) = 1 (n) in all cases; if this equation were true, the Scholz-Brauer conjecture would be settled, because of another theorem due to Hansen: Theorem G. 1 (2 -1) 2 n -1 + I (n). Proof. Let 1 = ao, al, . . , a, = n be an lo-chain of minimum length for n, andlet 1 =bo, bi, . . . . bt = n be the subsequence of underlined elements. (We may assume that n is underlined.) Then we can get an lo-chain for 2n -1 as follows: a) Include the 1 (n) + 1 numbers 2at - 1, for 0 2 i 5 T, underlined if and only if a, is underlined. b) Include the numbers 2i(2b J--l),forO -,6 -912 –f15 30 60 120 240 255 510 1020 1023 f-1 2 3 -, 31 ,-,~,~,~,~7~, 2040 ~,4095,8160,16320,32640,65280,130560,261120,262143. Graphical representation. An addition chain (1) corresponds in a natural way to a directed graph, where the vertices are labeled ai for 0 5 i 5 T, and where we draw arcs from a3 to a, and from ak to a, as a representation of each step a, = a? + ak in (2). For example, the addition chain 1, 2, 3, 6, 12, 15, 27, 39, 78, 79 that appears in Fig. 14 corresponds to the directed graph
Note: In case you are looking for affordable and reliable webhost to host and run your business application check Vision ftp web hosting services

This entry was posted on Thursday, May 3rd, 2007 at 10:00 pm and is filed under MySQL. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.