Log In
Email address
Password
Log in
New user? Click here to register.
Have you forgotten your password?
Colleges & Schools
Statistics
All of DSpace
Log In
Email address
Password
Log in
New user? Click here to register.
Have you forgotten your password?
Home
College of Science
School of Computer Science
Computer Science Research Collection
An upper bound on Jacobsthal's function
Details
Export
Statistics
Options
Show all metadata (technical view)
An upper bound on Jacobsthal's function
Author(s)
Costello, Fintan
Watts, Paul
Uri
http://hdl.handle.net/10197/6186
Date Issued
2014-11
Date Available
2014-11-21T12:56:41Z
Abstract
The function h(k) represents the smallest number m such that every sequence of m consecutive integers contains an integer coprime to the first k primes. We give a new computational method for calculating strong upper bounds on h(k).
Type of Material
Journal Article
Publisher
American Mathematical Society
Journal
Mathematics of Computation
Volume
84
Start Page
1389
End Page
1399
Copyright (Published Version)
2014 American Mathematical Society
Keywords
Integer sequences
Altorithms
DOI
10.1090/S0025-5718-2014-02896-2
Language
English
Status of Item
Peer reviewed
This item is made available under a Creative Commons License
https://creativecommons.org/licenses/by-nc-nd/3.0/ie/
File(s)
No Thumbnail Available
Name
CostelloWattsAccepted.pdf
Size
199.96 KB
Format
Download
Owning collection
Computer Science Research Collection
Scopus© citations
0
Acquisition Date
Mar 28, 2024
View Details
Views
1383
Acquisition Date
Mar 28, 2024
View Details
Downloads
472
Last Week
2
Last Month
3
Acquisition Date
Mar 28, 2024
View Details
google-scholar
View Details