2008
DOI: 10.1080/00029890.2008.11920606
|View full text |Cite
|
Sign up to set email alerts
|

Surprising Sinc Sums and Integrals

Abstract: His main area of research has been classical analysis, particularly summability theory.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
39
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 31 publications
(39 citation statements)
references
References 7 publications
0
39
0
Order By: Relevance
“…Consider the following empiricallydiscovered identity where the denumerators range over the primes. Provably, the following is true: The analogous "sum equals integral" identity remains valid for more than the first 10, 176 primes but stops holding after some larger prime, and thereafter the 'sum minus integral" is positive but much less than one part in a googolplex [3]. It is hard to imagine that inductive mathematics alone will ever be able to handle such behaviour .…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Consider the following empiricallydiscovered identity where the denumerators range over the primes. Provably, the following is true: The analogous "sum equals integral" identity remains valid for more than the first 10, 176 primes but stops holding after some larger prime, and thereafter the 'sum minus integral" is positive but much less than one part in a googolplex [3]. It is hard to imagine that inductive mathematics alone will ever be able to handle such behaviour .…”
Section: Discussionmentioning
confidence: 99%
“…This is equally true of extreme-precision calculation -a prerequisite for much of my own work [3,7] and others [9] -or in combinatorics.…”
Section: Example Ix: When Is Easy Bad?mentioning
confidence: 99%
See 1 more Smart Citation
“…As a single instance, it was discovered by Robert Baillie [2], after reading [21, §2.5], that for N = 1, 2, 3, 4, 5, and 6 (but not 7), …”
Section: Caveat Emptormentioning
confidence: 99%
“…A:=proc() local N; N:=args [1]; if nargs>1 then Digits:=args [2] fi; identify(evalf(G(N))), identify(evalf(a0(N)))+'n'*identify(evalf(a1(N))) end: B:=proc() local N; N:=args [1]; if nargs>1 then Digits:=args [2] fi; identify(evalf(g(N))), identify(evalf(b0(N)))+'n'*identify(evalf(b1(N))) end:…”
Section: Identifying Our Seriesmentioning
confidence: 99%