Numerical Methods, Binary, and finding two nearby machine numbers
$begingroup$
I have the question,
Find the binary form of the number x = 2/7
Suppose that the number x = 2/7 is stored in a 32-bit computer.
Find the two nearby machine numbers $x−$ and $x+$. Which of the two machine numbers is taken to be the floating point representation, $fl(x)$, of $x$? What are the absolute and the relative roundoff errors in representing $x$ by $fl(x)$?
I know how to do the steps, the issue im having is when calculating the machine numbers, $x+$ and $x-$, to calculate $fl(x)$ my binary form is correct but I feel I am converting back incorrectly.
e.g for $x-(x-)$ the binary form is $(1.0010010010010...) ·2^{-26}$
I need to convert this into decimal/fractional form to compare with $(x+) - x$, which should be $mathbf{4/7 ·2^{-25}}$. It seems I can't get the answer.
binary
$endgroup$
add a comment |
$begingroup$
I have the question,
Find the binary form of the number x = 2/7
Suppose that the number x = 2/7 is stored in a 32-bit computer.
Find the two nearby machine numbers $x−$ and $x+$. Which of the two machine numbers is taken to be the floating point representation, $fl(x)$, of $x$? What are the absolute and the relative roundoff errors in representing $x$ by $fl(x)$?
I know how to do the steps, the issue im having is when calculating the machine numbers, $x+$ and $x-$, to calculate $fl(x)$ my binary form is correct but I feel I am converting back incorrectly.
e.g for $x-(x-)$ the binary form is $(1.0010010010010...) ·2^{-26}$
I need to convert this into decimal/fractional form to compare with $(x+) - x$, which should be $mathbf{4/7 ·2^{-25}}$. It seems I can't get the answer.
binary
$endgroup$
add a comment |
$begingroup$
I have the question,
Find the binary form of the number x = 2/7
Suppose that the number x = 2/7 is stored in a 32-bit computer.
Find the two nearby machine numbers $x−$ and $x+$. Which of the two machine numbers is taken to be the floating point representation, $fl(x)$, of $x$? What are the absolute and the relative roundoff errors in representing $x$ by $fl(x)$?
I know how to do the steps, the issue im having is when calculating the machine numbers, $x+$ and $x-$, to calculate $fl(x)$ my binary form is correct but I feel I am converting back incorrectly.
e.g for $x-(x-)$ the binary form is $(1.0010010010010...) ·2^{-26}$
I need to convert this into decimal/fractional form to compare with $(x+) - x$, which should be $mathbf{4/7 ·2^{-25}}$. It seems I can't get the answer.
binary
$endgroup$
I have the question,
Find the binary form of the number x = 2/7
Suppose that the number x = 2/7 is stored in a 32-bit computer.
Find the two nearby machine numbers $x−$ and $x+$. Which of the two machine numbers is taken to be the floating point representation, $fl(x)$, of $x$? What are the absolute and the relative roundoff errors in representing $x$ by $fl(x)$?
I know how to do the steps, the issue im having is when calculating the machine numbers, $x+$ and $x-$, to calculate $fl(x)$ my binary form is correct but I feel I am converting back incorrectly.
e.g for $x-(x-)$ the binary form is $(1.0010010010010...) ·2^{-26}$
I need to convert this into decimal/fractional form to compare with $(x+) - x$, which should be $mathbf{4/7 ·2^{-25}}$. It seems I can't get the answer.
binary
binary
edited Jan 4 at 21:56
Rafa Budría
5,7151825
5,7151825
asked Jan 4 at 21:39
Mitul SuchakMitul Suchak
65
65
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3062144%2fnumerical-methods-binary-and-finding-two-nearby-machine-numbers%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3062144%2fnumerical-methods-binary-and-finding-two-nearby-machine-numbers%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown