|
|
A265769
|
|
Denominators of primes-only best approximates (POBAs) to 5; see Comments.
|
|
5
|
|
|
2, 2, 5, 7, 11, 13, 17, 19, 23, 31, 47, 53, 59, 61, 67, 71, 73, 79, 89, 97, 101, 109, 113, 131, 137, 149, 151, 157, 173, 181, 191, 193, 197, 199, 223, 233, 239, 257, 311, 313, 317, 331, 347, 349, 373, 383, 397, 401, 431, 443, 449, 457, 467, 479, 487, 509
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Suppose that x > 0. A fraction p/q of primes is a primes-only best approximate (POBA), and we write "p/q in B(x)", if 0 < |x - p/q| < |x - u/v| for all primes u and v such that v < q, and also, |x - p/q| < |x - p'/q| for every prime p' except p. Note that for some choices of x, there are values of q for which there are two POBAs. In these cases, the greater is placed first; e.g., B(3) = (7/2, 5/2, 17/5, 13/5, 23/7, 19/7, ...). See A265759 for a guide to related sequences.
|
|
LINKS
|
|
|
EXAMPLE
|
The POBAs to 5 start with 7/2, 11/2, 23/5, 37/7, 53/11, 67/13, 83/17, 97/19, 113/23, 157/31, 233/47. For example, if p and q are primes and q > 13, then 67/13 is closer to 5 than p/q is.
|
|
MATHEMATICA
|
x = 5; z = 200; p[k_] := p[k] = Prime[k];
t = Table[Max[Table[NextPrime[x*p[k], -1]/p[k], {k, 1, n}]], {n, 1, z}];
d = DeleteDuplicates[t]; tL = Select[d, # > 0 &] (* lower POBA *)
t = Table[Min[Table[NextPrime[x*p[k]]/p[k], {k, 1, n}]], {n, 1, z}];
d = DeleteDuplicates[t]; tU = Select[d, # > 0 &] (* upper POBA *)
v = Sort[Union[tL, tU], Abs[#1 - x] > Abs[#2 - x] &];
b = Denominator[v]; s = Select[Range[Length[b]], b[[#]] == Min[Drop[b, # - 1]] &];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,frac
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|