Dirichlet Eta Approximation
Compute finite real Dirichlet eta series for s>0 and analytic alternating-tail bound; caller exponent changes function, unlike Catalan constant fixed odd-square series.
Description
Dirichlet eta is an alternating reciprocal-power series for positive real exponent.
Dirichlet eta is an alternating reciprocal-power series for positive real exponent. Its decreasing positive amplitudes allow an alternating-series remainder bound.1
Compute finite real Dirichlet eta series for s>0 and analytic alternating-tail bound; caller exponent changes function, unlike Catalan constant fixed odd-square series.
When to use Dirichlet Eta Approximation
Use this tool to compute finite real Dirichlet eta series for s>0 and analytic alternating-tail bound; caller exponent changes function, unlike Catalan constant fixed odd-square series.
Choose the integer, sequence, coefficients or function parameters for your calculation. Follow the stated ordering, domain and size limits.
How to use Dirichlet Eta Approximation and understand its results
- Choose the integer, sequence, coefficients or function parameters for your calculation. Follow the stated ordering, domain and size limits.
- Enter exponent, seriesTerms using the field table and calculation rules, then run the tool.
- Read finiteDirichletEtaSum, alternatingRemainderAbsoluteBound. The explanation below defines the units, signs, ordering and any flags or placeholder values.
- If the tool reports an input issue, correct the values and run it again. Apply the stated assumptions when interpreting a successfully returned result.
| Input field | Meaning | Value type; see rules below | Requirement |
|---|---|---|---|
| exponent | Exponent | number | Required |
| seriesTerms | Series terms | number | Required |
Enter positive exponent and integer term count 1–one million. Sum the alternating terms and return the finite value plus the absolute analytic remainder bound.
eta partial sum = Σ[k=1..N](−1)^(k−1)/k^s; tail bound = (N+1)^(−s) Units, indexing, boundary conditions and exceptional cases are defined in the calculation rules above.
| Output field | Meaning | Value type |
|---|---|---|
| finiteDirichletEtaSum | Finite dirichlet eta sum | number |
| alternatingRemainderAbsoluteBound | Alternating remainder absolute bound | number |
{
"input": {
"exponent": 2,
"seriesTerms": 3
},
"output": {
"finiteDirichletEtaSum": 0.8611111111111112,
"alternatingRemainderAbsoluteBound": 0.0625
}
} Limitations and assumptions
The bound covers truncation, not floating-point accumulation. Analytic continuation to nonpositive exponents is not implemented.
Numeric inputs and returned numeric values must be finite; an unrepresentable returned value produces an error. Missing required fields, extra fields, wrong value types and violations of the calculation rules are input errors.
Alternative or Complementary methods
Use Beta Dirichlet Approximation: Compute finite real Dirichlet beta at supplied s>0 with explicit odd-denominator alternating-tail bound; not a fixed Catalan lookup or invented analytic continuation. For a complementary task, use Euler Transform Calculator: Compute finite Euler alternating-series transform Σ Δ^k a_0/2^(k+1), using Δa_n=a_n−a_(n+1); preserves finite differences and makes no infinite-series convergence promise.
References
-
Dirichlet Eta Approximation — tool.io
Similar or alternative tools
- Beta Dirichlet Approximation
Compute finite real Dirichlet beta at supplied s>0 with explicit odd-denominator alternating-tail bound; not a fixed Catalan lookup or invented analytic continuation.
- Euler Transform Calculator
Compute finite Euler alternating-series transform Σ Δ^k a_0/2^(k+1), using Δa_n=a_n−a_(n+1); preserves finite differences and makes no infinite-series convergence promise.