anti-logarithm (base $10$)












0












$begingroup$


Let's say that I start with the $log_{10}^7$, which is $0.84509804$, and I want to calculate $10^{0.84509804}$. $0.84509804$ is close to $431/510$. Without access to anything electronic, it seems that I would have to find the $510^{th}$ root of $10^{431}$. I believe that would be an iterative process requiring calculating $X^{510}$ for each iteration. Is that how the table values were calculated prior to 1950? It seems unbelievably tedious.



I apologize for my lack of proper notation.










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    nice question. You're right that the iterative process would be way too slow. Our ancestors knew many tricks for approximating roots, which our computers are still using under the hood; for example, Newton's method.
    $endgroup$
    – hunter
    Jan 11 at 4:49










  • $begingroup$
    Yes, Newton's method. It's been more than 30 years since I took Numerical Analysis, but I should have remembered that. Thanks.
    $endgroup$
    – Bob7430
    Jan 11 at 5:06






  • 1




    $begingroup$
    There was a lot of tedium in calculating tables. In years past "calculator" was a profession, not an electronic device. It was a full time job. There is a lot of regularity in tables which can relieve some of the work. I don't know what approaches were used. I can imagine that if you were going to do a table of base 10 logs, you might start with 1.1. Having done that you could get 1.21 by doubling, 1.331 by tripling and other values with small corrections. Then find the ones in between by interpolation.
    $endgroup$
    – Ross Millikan
    Jan 11 at 5:10
















0












$begingroup$


Let's say that I start with the $log_{10}^7$, which is $0.84509804$, and I want to calculate $10^{0.84509804}$. $0.84509804$ is close to $431/510$. Without access to anything electronic, it seems that I would have to find the $510^{th}$ root of $10^{431}$. I believe that would be an iterative process requiring calculating $X^{510}$ for each iteration. Is that how the table values were calculated prior to 1950? It seems unbelievably tedious.



I apologize for my lack of proper notation.










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    nice question. You're right that the iterative process would be way too slow. Our ancestors knew many tricks for approximating roots, which our computers are still using under the hood; for example, Newton's method.
    $endgroup$
    – hunter
    Jan 11 at 4:49










  • $begingroup$
    Yes, Newton's method. It's been more than 30 years since I took Numerical Analysis, but I should have remembered that. Thanks.
    $endgroup$
    – Bob7430
    Jan 11 at 5:06






  • 1




    $begingroup$
    There was a lot of tedium in calculating tables. In years past "calculator" was a profession, not an electronic device. It was a full time job. There is a lot of regularity in tables which can relieve some of the work. I don't know what approaches were used. I can imagine that if you were going to do a table of base 10 logs, you might start with 1.1. Having done that you could get 1.21 by doubling, 1.331 by tripling and other values with small corrections. Then find the ones in between by interpolation.
    $endgroup$
    – Ross Millikan
    Jan 11 at 5:10














0












0








0


1



$begingroup$


Let's say that I start with the $log_{10}^7$, which is $0.84509804$, and I want to calculate $10^{0.84509804}$. $0.84509804$ is close to $431/510$. Without access to anything electronic, it seems that I would have to find the $510^{th}$ root of $10^{431}$. I believe that would be an iterative process requiring calculating $X^{510}$ for each iteration. Is that how the table values were calculated prior to 1950? It seems unbelievably tedious.



I apologize for my lack of proper notation.










share|cite|improve this question











$endgroup$




Let's say that I start with the $log_{10}^7$, which is $0.84509804$, and I want to calculate $10^{0.84509804}$. $0.84509804$ is close to $431/510$. Without access to anything electronic, it seems that I would have to find the $510^{th}$ root of $10^{431}$. I believe that would be an iterative process requiring calculating $X^{510}$ for each iteration. Is that how the table values were calculated prior to 1950? It seems unbelievably tedious.



I apologize for my lack of proper notation.







logarithms






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 11 at 5:14









Lee

330111




330111










asked Jan 11 at 4:45









Bob7430Bob7430

11




11








  • 2




    $begingroup$
    nice question. You're right that the iterative process would be way too slow. Our ancestors knew many tricks for approximating roots, which our computers are still using under the hood; for example, Newton's method.
    $endgroup$
    – hunter
    Jan 11 at 4:49










  • $begingroup$
    Yes, Newton's method. It's been more than 30 years since I took Numerical Analysis, but I should have remembered that. Thanks.
    $endgroup$
    – Bob7430
    Jan 11 at 5:06






  • 1




    $begingroup$
    There was a lot of tedium in calculating tables. In years past "calculator" was a profession, not an electronic device. It was a full time job. There is a lot of regularity in tables which can relieve some of the work. I don't know what approaches were used. I can imagine that if you were going to do a table of base 10 logs, you might start with 1.1. Having done that you could get 1.21 by doubling, 1.331 by tripling and other values with small corrections. Then find the ones in between by interpolation.
    $endgroup$
    – Ross Millikan
    Jan 11 at 5:10














  • 2




    $begingroup$
    nice question. You're right that the iterative process would be way too slow. Our ancestors knew many tricks for approximating roots, which our computers are still using under the hood; for example, Newton's method.
    $endgroup$
    – hunter
    Jan 11 at 4:49










  • $begingroup$
    Yes, Newton's method. It's been more than 30 years since I took Numerical Analysis, but I should have remembered that. Thanks.
    $endgroup$
    – Bob7430
    Jan 11 at 5:06






  • 1




    $begingroup$
    There was a lot of tedium in calculating tables. In years past "calculator" was a profession, not an electronic device. It was a full time job. There is a lot of regularity in tables which can relieve some of the work. I don't know what approaches were used. I can imagine that if you were going to do a table of base 10 logs, you might start with 1.1. Having done that you could get 1.21 by doubling, 1.331 by tripling and other values with small corrections. Then find the ones in between by interpolation.
    $endgroup$
    – Ross Millikan
    Jan 11 at 5:10








2




2




$begingroup$
nice question. You're right that the iterative process would be way too slow. Our ancestors knew many tricks for approximating roots, which our computers are still using under the hood; for example, Newton's method.
$endgroup$
– hunter
Jan 11 at 4:49




$begingroup$
nice question. You're right that the iterative process would be way too slow. Our ancestors knew many tricks for approximating roots, which our computers are still using under the hood; for example, Newton's method.
$endgroup$
– hunter
Jan 11 at 4:49












$begingroup$
Yes, Newton's method. It's been more than 30 years since I took Numerical Analysis, but I should have remembered that. Thanks.
$endgroup$
– Bob7430
Jan 11 at 5:06




$begingroup$
Yes, Newton's method. It's been more than 30 years since I took Numerical Analysis, but I should have remembered that. Thanks.
$endgroup$
– Bob7430
Jan 11 at 5:06




1




1




$begingroup$
There was a lot of tedium in calculating tables. In years past "calculator" was a profession, not an electronic device. It was a full time job. There is a lot of regularity in tables which can relieve some of the work. I don't know what approaches were used. I can imagine that if you were going to do a table of base 10 logs, you might start with 1.1. Having done that you could get 1.21 by doubling, 1.331 by tripling and other values with small corrections. Then find the ones in between by interpolation.
$endgroup$
– Ross Millikan
Jan 11 at 5:10




$begingroup$
There was a lot of tedium in calculating tables. In years past "calculator" was a profession, not an electronic device. It was a full time job. There is a lot of regularity in tables which can relieve some of the work. I don't know what approaches were used. I can imagine that if you were going to do a table of base 10 logs, you might start with 1.1. Having done that you could get 1.21 by doubling, 1.331 by tripling and other values with small corrections. Then find the ones in between by interpolation.
$endgroup$
– Ross Millikan
Jan 11 at 5:10










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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3069480%2fanti-logarithm-base-10%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
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3069480%2fanti-logarithm-base-10%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Mario Kart Wii

The Binding of Isaac: Rebirth/Afterbirth

What does “Dominus providebit” mean?