Examples
Examples
Try the starting example
- Selected exponential-window times (hours)
- 0,12,24,36
- Measured cell counts
- 100,150,225,337.5
- Exponential growth rate (1/hour)
- 0.033789
- Doubling time (hours)
- 20.514135
- Log-space R squared
- 1
Try another scenario
- Selected exponential-window times (hours)
- [0, 12, 24, 36]
- Measured cell counts
- [100, 200, 400, 800]
- Exponential growth rate (1/hour)
- 0.057762
- Doubling time (hours)
- 12
- Log-space R squared
- 1
Calculation method
Calculation method
Exponential growth rate (1/hour)
OLS natural-log(count) against supplied selected times.
Doubling time (hours)
ln2/growth rate when rate>0; nonpositive rates have no positive doubling time.
Log-space R squared
Fit diagnostic for supplied window; does not select exponential phase.
Symbols and units
- a
- Selected exponential-window times (hours)
- b
- Measured cell counts
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- Time-count observations, selected exponential window. Returns Fitted growth rate and doubling estimate. All coefficients and observations are user supplied; results describe only the stated mathematical model. Quantities are deterministic calculations from supplied observations and assumptions; no external data is fetched. Supported limits: Finite inputs only; numeric fields bounded as labelled. Lists and JSON records are limited to 256 entries unless a stricter tool bound is stated. No automatic design approval, legal conclusion, treatment recommendation or safety certification. Selected exponential-window times (hours): minimum None, maximum 1000000000000.0. Measured cell counts: minimum 1e-12, maximum 1000000000000.0.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.
Further reading
Background reading; this does not imply endorsement or independent review of SumFizz.