Samuel S. Gross

Samuel S. Gross
Noblis, Inc.

Ph.D.

About

7
Publications
399
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
10
Citations
Additional affiliations
September 2015 - present
Noblis, Inc.
Position
  • Senior Cryptographer
August 2013 - August 2015
Bloomsburg University
Position
  • Assistant Professor of Mathematics
August 2012 - August 2013
Rocky Mountain College
Position
  • Research Assistant
Education
September 2007 - May 2012
University of South Carolina
Field of study
  • Mathematics
September 2003 - May 2007
Kent State University
Field of study
  • Mathematics

Publications

Publications (7)
Technical Report
Full-text available
The Factorization of RSA230 from the RSA Challenge.
Article
Full-text available
In a recent article, Nowicki introduced the concept of a special number. Specifically, an integer d is called special if for every integer m there exist solutions in non-zero integers a, b, c to the equation a2 +b9 −dc2 = m. In this article we investigate pairs of integers (n, d), with n ≥ 2, such that for every integer m there exist units a, b, an...
Article
Full-text available
Let f (x) be a polynomial with non-negative integer coefficients for which f (10) is prime. A result of A. Cohn implies that if the coefficients of f (x) are ≤ 9, then f (x) is irreducible. In 1988, the first author showed that the bound 9 could be replaced by 10 30. We show here that the bound 9 can be replaced by the number in the title and that...
Article
Full-text available
Let S be a finite set of rational primes. For a non-zero integer n, define , where |n|p is the usual p-adic norm of n. In 1984, Stewart applied Baker's theorem to prove non-trivial, computationally effective upper bounds for [n(n+1)⋯(n+k)]S for any integer k > 0. Effective upper bounds have also been given by Bennett, Filaseta, and Trifonov for [n(...

Network

Cited By