#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2015

2017

- This year (2)
- Last 5 years (3)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

There is a large literature on the asymptotic distribution of numbers free of large prime factors, so-called smooth or friable numbers. But there is very little known about this distribution that is numerically explicit. In this paper we follow the general plan for the saddle point argument of Hildebrand and Tenenbaum, giving explicit and fairly tight… (More)

- Jared D. Lichtman
- ArXiv
- 2015

We provide a problem definition of the stable marriage problem for a general number of parties p under a natural preference scheme in which each person has simple lists for the other parties. We extend the notion of stability in a natural way and present so called elemental and compound algorithms to generate matchings for a problem instance. We demonstrate… (More)

We investigate the probability that a random odd composite number passes a random Fermat primality test, improving on earlier estimates in moderate ranges. For example, with random numbers to 2200, our results improve on prior estimates by close to 3 orders of magnitude.

- ‹
- 1
- ›