[go: up one dir, main page]

login
Revision History for A291511 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
The arithmetic function uhat(n,2,6).
(history; published version)
#4 by Susanna Cuyler at Fri Aug 25 23:40:46 EDT 2017
STATUS

proposed

approved

#3 by Robert Price at Fri Aug 25 09:12:34 EDT 2017
STATUS

editing

proposed

#2 by Robert Price at Fri Aug 25 09:12:26 EDT 2017
NAME

allocated for Robert PriceThe arithmetic function uhat(n,2,6).

DATA

-23, -24, -23, -24, -23, -24, -23, -24, -27, -30, -33, -36, -39, -42, -45, -48, -51, -54, -57, -60, -63, -66, -69, -72, -75, -78, -81, -84, -87, -90, -93, -96, -99, -102, -105, -108, -111, -114, -117, -120, -123, -126, -129, -132, -135, -138, -141, -144, -147, -150, -153, -156, -159, -162, -165, -168, -171, -174, -177, -180, -183, -186, -189, -192, -195, -198, -201, -204, -207, -210

OFFSET

1,1

LINKS

Bela Bajnok, <a href="https://arxiv.org/abs/1705.07444">Additive Combinatorics: A Menu of Research Problems</a>, arXiv:1705.07444 [math.NT], May 2017. See Table in Section 1.6.4.

MATHEMATICA

delta[r_, k_, d_] := If[r < k, (k - r)*r - (d - 1), If[k < r && r < d, (d - r)*(r - k) - (d - 1), If[k == r && r == d, d - 1, 0]]] uhat[n_, m_, h_] := (dx = Divisors[n]; dmin = n; For[i = 1, i ≤ Length[dx], i++, d = dx[[i]]; k = m - d*Ceiling[m/d] + d; r = h - d*Ceiling[h/d] + d; If[h ≤ Min[k, d - 1], dmin = Min[dmin, n, (h*Ceiling[m/d] - h + 1)*d, h*m - h*h + 1], dmin = Min[dmin, n, h*m - h*h + 1 - delta[r, k, d]]]]; dmin) Table[uhat[n, 2, 6], {n, 1, 70}]

KEYWORD

allocated

sign,new

AUTHOR

Robert Price, Aug 25 2017

STATUS

approved

editing

#1 by Robert Price at Fri Aug 25 09:12:26 EDT 2017
NAME

allocated for Robert Price

KEYWORD

allocated

STATUS

approved