Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with computer-arithmetic
Search options not deleted
user 28440
For questions about the particulars of doing math on computers, e.g. floating point numbers, over/underflow, implementing arithmetic operators/functions for binary numbers.
6
votes
3
answers
211
views
Method to compute $a^n - b^n$
Given two floating point numbers $a,b$ with $a > b$ and an integer $n$, what is the most accurate way to compute
$$
a^n - b^n
$$
? We can assume both $a,b$ are between 1 and 2. Lets assume both $a^n$ …
- 1,078