dc.contributor.author | Banks, William David, 1964- | eng |

dc.contributor.author | Hart, Derrick, 1980- | eng |

dc.contributor.author | Sakata, Mayumi | eng |

dc.date.issued | 2004 | eng |

dc.description | First published in Mathematical Research Letters 11 (2004) nos.5-6, pp.853-868, published by International Press. ©International Press. | eng |

dc.description.abstract | We study the distribution of palindromic numbers (with respect to a fixed base g ≥ 2) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes n ≤ x as x → ∞. Our results show that almost all palindromes in a given base are composite. | eng |

dc.identifier.uri | http://hdl.handle.net/10355/10648 | eng |

dc.relation.ispartof | Mathematics publications (MU) | eng |

dc.relation.ispartofcommunity | University of Missouri-Columbia. College of Arts and Sciences. Department of Mathematics | eng |

dc.source.uri | http://www.math.missouri.edu/~bbanks/papers/index.html | eng |

dc.subject.lcsh | Number theory | eng |

dc.subject.lcsh | Modular arithmetic | eng |

dc.title | Almost All Palindromes Are Composite | eng |

dc.type | Preprint | eng |