### Table 1. Density of consecutive primes in arithmetic progression

1997

"... In PAGE 2: ... Near such an N is where the density of k consecutive primes in AP should be at a maximum. Table1 summarizes these results. While simply searching the sequence of primes up to about 1010 would be a viable way to look for 6 consecutive primes in AP, the size of the likely candidate values for 7 such primes preclude this approach.... ..."

Cited by 2

### Table 1. Density of Consecutive Primes in Arithmetic Progression

"... In PAGE 2: ...5) Near such an Nm is where the density of k consecutive primes in AP should be at a maximum. Table1 summarizes these results up to k = 13. The product of Q(k)andNm gives the expected number of k sets in the range Nm to 2Nm.... In PAGE 4: ... 5. Future work Table1 shows that if 11 consecutive primes in AP were found, the size of the primes would be about 900 digits with a prescribed set of 23,090 composite numbers. The search would take at least 1012 times longer than the search for 10-primes.... ..."

### Table 3. Consecutive Primes in Arithmetic Progression

"... In PAGE 4: ... Completely unexpectedly, on March 2, 1998, 10 consecutive primes in AP were found during the test phase after only 3% of the estimated total CPU time was used. The 8-, 9- and 10-prime solutions are shown in Table3 . The probable primes were veri ed by using the APRT-CLE program in UBASIC, and just to be sure, they were certi ed again by the ECPP program of Fran cois Morain.... In PAGE 4: ... A particularly challenging problem that may be possible to solve with existing technology is to nd the smallest 7 consecutive primes in AP. The smallest such set that is known consists of 37 digit primes and the solution is shown in Table3 . The largest such... ..."

### Table 8. Progress of SEGSQ algorithm in Example 10

in CONTENTS

1963

"... In PAGE 18: ... It would require higher precision than the 27-bit arithmetic that was used to accurately compute the rms in this case, but the con- vergence can be judged by noting the apparently linear convergence toward zero of the quantities (e;+] -e;). Rep- resentative data is given in Table8 . The lengths of the final subintervals varied monotonically from s1 = 0.... ..."

### Table 1.1. E ects of residuosity in arithmetic progressions for rank 3 quadratic twists for the congruent number curve (data from Elkies)

### Table 4: Progressive-resolution transmission rates (bit/pixel).

"... In PAGE 6: ... The Markov model does not change the speed of the arithmetic encoder, and can explore the remaining dependencies between transform pixels. Table4 shows the results of those tests. The same le was used to progressively recover images at increasingly ner resolutions.... ..."

### Table 4 Required times for computing dense disparity map (in ms) Calculation step Map images Tsukuba

2005

"... In PAGE 11: ... And the time to reduce errors at depth discontinuities depends on the amount of depth discontinuities. Table4 shows the required time from each side of the region and progresses toward References Chen, T.... ..."

### Table 3: The complexity of the arithmetic work and data accesses for factoriza- tion, for various problems.

"... In PAGE 16: ...a significant potential for data reuse. Table3 lists the number of arithmetic operations and the number of data accesses for the sparsest (a diagonal matrix) and the densest factorizations (a dense matrix), as well as for the factorization of the 2-d and 3-d problems ordered by nested dissection. The ratio between the number of arithmetic operations and the number of data accesses, which indicates the potential for data reuse, is also listed in Table 3, showing that the denser the factorization, the larger the potential for data reuse.... In PAGE 16: ... Table 3 lists the number of arithmetic operations and the number of data accesses for the sparsest (a diagonal matrix) and the densest factorizations (a dense matrix), as well as for the factorization of the 2-d and 3-d problems ordered by nested dissection. The ratio between the number of arithmetic operations and the number of data accesses, which indicates the potential for data reuse, is also listed in Table3 , showing that the denser the factorization, the larger the potential for data reuse.... ..."

### Table 2: Dense graphs

"... In PAGE 5: ... The default CPLEX cuts are added in both runs. In Table2 , we summarize the computations on dense graphs (75% link density). We see that we obtain more than twice as much integrality gap improvement at the root when survavibility cuts are added.... ..."

### Table 4. Dense Codes

2002

Cited by 4