Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Alzer, Horsta; * | Kwong, Man Kamb; **
Affiliations: [a] Morsbacher Straße 10, 51545 Waldbröl, Germany. E-mail: [email protected] | [b] Department of Mathematics, The Hong Kong Polytechnic University, Hunghom, Hong Kong. E-mail: [email protected]
Correspondence: [*] Corresponding author. E-mail: [email protected].
Note: [**] The research of this author is supported by the Hong Kong Government GRF Grant PolyU 5003/12P and the Hong Kong Polytechnic University Grants G-UC22 and G-UA10.
Abstract: In 1974, Askey and Steinig showed that for n⩾0 and x∈(0,2π), Sn(x)=∑k=0nsin((k+1/4)x)k+1>0andCn(x)=∑k=0ncos((k+1/4)x)k+1>0. We prove that (0.1)Sn(x)+Cn(x)⩾12 and that the alternating sums Sn∗(x)=∑k=0n(−1)ksin((k+1/4)x)k+1andCn∗(x)=∑k=0n(−1)kcos((k+1/4)x)k+1 satisfy (0.2)Sn∗(x)+Cn∗(x)⩾1200(13−85)300+2085=0.41601…. Both inequalities hold for all n⩾0 and x∈[0,2π]. The constant lower bounds given in (0.1) and (0.2) are best possible. The asymptotic behaviour of both sums is also investigated.
Keywords: Trigonometric sums, inequalities, asymptotics
DOI: 10.3233/ASY-171447
Journal: Asymptotic Analysis, vol. 106, no. 3-4, pp. 233-249, 2018
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]