<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2004-04-01 11:58:00Fourier analysis Formula for primes Combinatory logic Lambda calculus Logic in computer science |
| THE RESIDUE OF p(N ) MODULO SMALL PRIMES Ken Ono Dedicated to the memory of Paul Erd¨ os Abstract. For primes ` we obtain a simple formula for p(N ) (mod `) as a weighted sumDocID: 1mBtU - View Document |
| §1 1. Printing primes: An example of WEB. The following program is essentially the same as Edsger Dijkstra’s “first example of step-wise program composition,” found on pages 26–39 of his Notes on Structured ProgDocID: 18yZ3 - View Document |
| A separation between semantic and syntactic cutting planes Yuval Filmus Massimo Lauria March 30, 2013DocID: 13kRJ - View Document |
| Is There a Formula that Generates Prime Numbers?DocID: EgB2 - View Document |
| Which program is better? Why? A What do we mean by “better”?DocID: fBtO - View Document |