J u m p t o c o n t e n t
M a i n m e n u
M a i n m e n u
N a v i g a t i o n
● M a i n p a g e
● C o n t e n t s
● C u r r e n t e v e n t s
● R a n d o m a r t i c l e
● A b o u t W i k i p e d i a
● C o n t a c t u s
● D o n a t e
C o n t r i b u t e
● H e l p
● L e a r n t o e d i t
● C o m m u n i t y p o r t a l
● R e c e n t c h a n g e s
● U p l o a d f i l e
S e a r c h
Search
A p p e a r a n c e
● C r e a t e a c c o u n t
● L o g i n
P e r s o n a l t o o l s
● C r e a t e a c c o u n t
● L o g i n
P a g e s f o r l o g g e d o u t e d i t o r s l e a r n m o r e
● C o n t r i b u t i o n s
● T a l k
( T o p )
1
H i s t o r y
2
U s a g e
3
S e e a l s o
4
R e f e r e n c e s
T o g g l e t h e t a b l e o f c o n t e n t s
H o o l e y ' s d e l t a f u n c t i o n
A d d l a n g u a g e s
A d d l i n k s
● A r t i c l e
● T a l k
E n g l i s h
● R e a d
● E d i t
● V i e w h i s t o r y
T o o l s
T o o l s
A c t i o n s
● R e a d
● E d i t
● V i e w h i s t o r y
G e n e r a l
● W h a t l i n k s h e r e
● R e l a t e d c h a n g e s
● U p l o a d f i l e
● S p e c i a l p a g e s
● P e r m a n e n t l i n k
● P a g e i n f o r m a t i o n
● C i t e t h i s p a g e
● G e t s h o r t e n e d U R L
● D o w n l o a d Q R c o d e
● W i k i d a t a i t e m
P r i n t / e x p o r t
● D o w n l o a d a s P D F
● P r i n t a b l e v e r s i o n
A p p e a r a n c e
F r o m W i k i p e d i a , t h e f r e e e n c y c l o p e d i a
Hooley's delta function Named after Christopher Hooley Publication year 1979 Author of publication Paul Erdős First terms 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1 OEIS indexA226898
Mathematical function
In mathematics , Hooley's delta function (
Δ
(
n
)
{\displaystyle \Delta (n )}
) , also called Erdős--Hooley delta-function , defines the maximum number of divisors of
n
{\displaystyle n}
in
[
u
,
e
u
]
{\displaystyle [u,eu]}
for all
u
{\displaystyle u}
, where
e
{\displaystyle e}
is the Euler's number . The first few terms of this sequence are
1
,
2
,
1
,
2
,
1
,
2
,
1
,
2
,
1
,
2
,
1
,
3
,
1
,
2
,
2
,
2
,
1
,
2
,
1
,
3
,
2
,
2
,
1
,
4
{\displaystyle 1,2,1,2,1,2,1,2,1,2,1,3,1,2,2,2,1,2,1,3,2,2,1,4}
(sequence A226898 in the OEIS ).
History [ edit ]
The sequence was first introduced by Paul Erdős in 1974,[1] then studied by Christopher Hooley in 1979.[2]
In 2023, Dimitris Koukoulopoulos and Terence Tao proved that the sum of the first
n
{\displaystyle n}
terms,
∑
k
=
1
n
Δ
(
k
)
≪
n
(
log
log
n
)
11
/
4
{\displaystyle \textstyle \sum _{k=1}^{n}\Delta (k )\ll n(\log \log n)^{11/4}}
, for
n
≥
100
{\displaystyle n\geq 100}
.[3] In particular, the
average order of
Δ
(
n
)
{\displaystyle \Delta (n )}
to
k
{\displaystyle k}
is
O
(
(
log
n
)
k
)
{\displaystyle O((\log n)^{k})}
for any
k
>
0
{\displaystyle k>0}
.[4]
Later in 2023 Kevin Ford , Koukoulopoulos , and Tao proved the lower bound
∑
k
=
1
n
Δ
(
k
)
≫
n
(
log
log
n
)
1
+
η
−
ϵ
{\displaystyle \textstyle \sum _{k=1}^{n}\Delta (k )\gg n(\log \log n)^{1+\eta -\epsilon }}
, where
η
=
0.3533227
…
{\displaystyle \eta =0.3533227\ldots }
, fixed
ϵ
{\displaystyle \epsilon }
, and
n
≥
100
{\displaystyle n\geq 100}
.[5]
This function measures the tendency of divisors of a number to cluster.
The growth of this sequence is limited by
Δ
(
m
n
)
≤
Δ
(
n
)
d
(
m
)
{\displaystyle \Delta (mn )\leq \Delta (n )d(m )}
where
d
(
n
)
{\displaystyle d(n )}
is the number of divisors of
n
{\displaystyle n}
.[6]
See also [ edit ]
References [ edit ]
^ Koukoulopoulos, D.; Tao, T. (2023). "An upper bound on the mean value of the Erdős–Hooley Delta function". Proceedings of the London Mathematical Society . 127 (6 ): 1865–1885. arXiv :2306.08615 . doi :10.1112/plms.12572 .
^ "O" stands for the Big O notation .
^ Ford, Kevin; Koukoulopoulos, Dimitris; Tao, Terence (2023). "A lower bound on the mean value of the Erdős-Hooley Delta function". arXiv :2308.11987 [math.NT ].
^ Greathouse, Charles R. "Sequence A226898 (Hooley's Delta function: maximum number of divisors of n in [u, eu] for all u. (Here e is Euler's number 2.718... = A001113.))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2022-12-18 .
t
e
Possessing a specific set of other numbers
Expressible via specific sums
R e t r i e v e d f r o m " https://en.wikipedia.org/w/index.php?title=Hooley%27s_delta_function&oldid=1211616688 "
C a t e g o r i e s :
● D i v i s o r f u n c t i o n
● A r i t h m e t i c f u n c t i o n s
● N u m b e r t h e o r y
● I n t e g e r s e q u e n c e s
H i d d e n c a t e g o r i e s :
● A r t i c l e s w i t h s h o r t d e s c r i p t i o n
● S h o r t d e s c r i p t i o n m a t c h e s W i k i d a t a
● T h i s p a g e w a s l a s t e d i t e d o n 3 M a r c h 2 0 2 4 , a t 1 4 : 1 9 ( U T C ) .
● T e x t i s a v a i l a b l e u n d e r t h e C r e a t i v e C o m m o n s A t t r i b u t i o n - S h a r e A l i k e L i c e n s e 4 . 0 ;
a d d i t i o n a l t e r m s m a y a p p l y . B y u s i n g t h i s s i t e , y o u a g r e e t o t h e T e r m s o f U s e a n d P r i v a c y P o l i c y . W i k i p e d i a ® i s a r e g i s t e r e d t r a d e m a r k o f t h e W i k i m e d i a F o u n d a t i o n , I n c . , a n o n - p r o f i t o r g a n i z a t i o n .
● P r i v a c y p o l i c y
● A b o u t W i k i p e d i a
● D i s c l a i m e r s
● C o n t a c t W i k i p e d i a
● C o d e o f C o n d u c t
● D e v e l o p e r s
● S t a t i s t i c s
● C o o k i e s t a t e m e n t
● M o b i l e v i e w