Mathematics – Number Theory
Scientific paper
2010-01-23
Proc. Amer. Math. Soc. 139 (2011), 3423-3430
Mathematics
Number Theory
8 pages, LaTeX. Added DOIs for most references; corrected a minor error in arithmetic; made small copy-editing changes. To app
Scientific paper
10.1090/S0002-9939-2011-10764-0
A double-base representation of an integer n is an expression n = n_1 + ... + n_r, where the n_i are (positive or negative) integers that are divisible by no primes other than 2 or 3; the length of the representation is the number r of terms. It is known that there is a constant a > 0 such that every integer n has a double-base representation of length at most a log n / log log n. We show that there is a constant c > 0 such that there are infinitely many integers n whose shortest double-base representations have length greater than c log n / (log log n log log log n). Our methods allow us to find the smallest positive integers with no double-base representations of several lengths. In particular, we show that 103 is the smallest positive integer with no double-base representation of length 2, that 4985 is the smallest positive integer with no double-base representation of length 3, that 641687 is the smallest positive integer with no double-base representation of length 4, and that 326552783 is the smallest positive integer with no double-base representation of length 5.
Dimitrov Vassil S.
Howe Everett W.
No associations
LandOfFree
Lower bounds on the lengths of double-base representations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Lower bounds on the lengths of double-base representations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds on the lengths of double-base representations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-514887