$pi^4 + pi^5 approx e^6$ is anything special going on here?
Saw it in the news:
$$(pi^4 + pi^5)^{Largefrac16} approx 2.71828180861$$
Is this just pigeon-hole?
DISCUSSION: counterfeit $e$ using $pi$'s
Given enough integers and $pi$'s we can approximate just about any number. In formal mathematical language we say this set is dense in the real numbers:
$$ overline{ mathbb{Z}[pi]} = mathbb{R}$$
This is only part of the story since it doesn't tell us how big our integers have to be in order to approximate the constant of our choosing? Maybe we can quantify this with a notion of density?
$$ mu_N([a,b]) = frac{# |{ m + n pi: -N leq m,n leq N }cap[a,b]|}{N^2} $$
The example above works because of the constants 4, 5 and 6.
We can focus on a particular constant and ask how much effort it takes to approximate a given constant:
$$ big{ (m,n)in mathbb{Z}^2: big| m + n pi - alpha big|< epsilon big} $$
In our case we need to incorporate for square roots, cube roots and higher.
Generalization How closely can we approximate $e$ using powers of $pi$ and $n$-th roots?
$$displaystyle ( a + bpi )^{1/p} approx e $$
Here $0 leq |a|,|b|,p leq 10$
exponential-function approximation pi constants diophantine-approximation
|
show 6 more comments
Saw it in the news:
$$(pi^4 + pi^5)^{Largefrac16} approx 2.71828180861$$
Is this just pigeon-hole?
DISCUSSION: counterfeit $e$ using $pi$'s
Given enough integers and $pi$'s we can approximate just about any number. In formal mathematical language we say this set is dense in the real numbers:
$$ overline{ mathbb{Z}[pi]} = mathbb{R}$$
This is only part of the story since it doesn't tell us how big our integers have to be in order to approximate the constant of our choosing? Maybe we can quantify this with a notion of density?
$$ mu_N([a,b]) = frac{# |{ m + n pi: -N leq m,n leq N }cap[a,b]|}{N^2} $$
The example above works because of the constants 4, 5 and 6.
We can focus on a particular constant and ask how much effort it takes to approximate a given constant:
$$ big{ (m,n)in mathbb{Z}^2: big| m + n pi - alpha big|< epsilon big} $$
In our case we need to incorporate for square roots, cube roots and higher.
Generalization How closely can we approximate $e$ using powers of $pi$ and $n$-th roots?
$$displaystyle ( a + bpi )^{1/p} approx e $$
Here $0 leq |a|,|b|,p leq 10$
exponential-function approximation pi constants diophantine-approximation
13
A good approximation of order approx. $;10^{-7};$ ....that's all. There are literally thousands of different such approximations to all kinds of numbers.
– DonAntonio
Jun 14 '14 at 11:07
4
This is most likely a coincidence, as the approximation is explained well by a long-known astonishing coincidence $pi approx e^pi - 20$. For example, $log(pi^4 + pi^5) = 4log(pi)+log(1+pi)$ and applying the above with the crude estimation $exp(pi) approx 23$ in mind, one has $log(pi) approx log(exp(pi)-20) approx pi + log(1-20/exp(pi)) approx pi + log(3/23)$ and similarly $log(1+pi) approx log(exp(pi) - 19) approx pi + log(4/23)$. Adding up, we have $5pi + log(3^4/23^4cdot 4/23) approx 5.811$ which is much close to $6$.
– Balarka Sen
Jun 14 '14 at 12:23
3
Is there a question here?
– Alexander Gruber♦
Jun 14 '14 at 12:48
5
@johnmangual I see a question mark but the words behind it do not make sense. Please clarify your meaning of "is this pigeonhole" as requested.
– Alexander Gruber♦
Jun 14 '14 at 16:10
3
$piapproxdfrac{ln(640320^3+744)}{sqrt{163}}$ , with a precision of $30$ exact decimals. Discovered independently by both Charles Hermite and Srinivasa Ramanujan. Based on the fact that $e^{pisqrt H}$ is an almost integer when H is a Heegner number.
– Lucian
Jun 14 '14 at 17:23
|
show 6 more comments
Saw it in the news:
$$(pi^4 + pi^5)^{Largefrac16} approx 2.71828180861$$
Is this just pigeon-hole?
DISCUSSION: counterfeit $e$ using $pi$'s
Given enough integers and $pi$'s we can approximate just about any number. In formal mathematical language we say this set is dense in the real numbers:
$$ overline{ mathbb{Z}[pi]} = mathbb{R}$$
This is only part of the story since it doesn't tell us how big our integers have to be in order to approximate the constant of our choosing? Maybe we can quantify this with a notion of density?
$$ mu_N([a,b]) = frac{# |{ m + n pi: -N leq m,n leq N }cap[a,b]|}{N^2} $$
The example above works because of the constants 4, 5 and 6.
We can focus on a particular constant and ask how much effort it takes to approximate a given constant:
$$ big{ (m,n)in mathbb{Z}^2: big| m + n pi - alpha big|< epsilon big} $$
In our case we need to incorporate for square roots, cube roots and higher.
Generalization How closely can we approximate $e$ using powers of $pi$ and $n$-th roots?
$$displaystyle ( a + bpi )^{1/p} approx e $$
Here $0 leq |a|,|b|,p leq 10$
exponential-function approximation pi constants diophantine-approximation
Saw it in the news:
$$(pi^4 + pi^5)^{Largefrac16} approx 2.71828180861$$
Is this just pigeon-hole?
DISCUSSION: counterfeit $e$ using $pi$'s
Given enough integers and $pi$'s we can approximate just about any number. In formal mathematical language we say this set is dense in the real numbers:
$$ overline{ mathbb{Z}[pi]} = mathbb{R}$$
This is only part of the story since it doesn't tell us how big our integers have to be in order to approximate the constant of our choosing? Maybe we can quantify this with a notion of density?
$$ mu_N([a,b]) = frac{# |{ m + n pi: -N leq m,n leq N }cap[a,b]|}{N^2} $$
The example above works because of the constants 4, 5 and 6.
We can focus on a particular constant and ask how much effort it takes to approximate a given constant:
$$ big{ (m,n)in mathbb{Z}^2: big| m + n pi - alpha big|< epsilon big} $$
In our case we need to incorporate for square roots, cube roots and higher.
Generalization How closely can we approximate $e$ using powers of $pi$ and $n$-th roots?
$$displaystyle ( a + bpi )^{1/p} approx e $$
Here $0 leq |a|,|b|,p leq 10$
exponential-function approximation pi constants diophantine-approximation
exponential-function approximation pi constants diophantine-approximation
edited Dec 27 '18 at 5:05
Martin Sleziak
44.7k7115270
44.7k7115270
asked Jun 14 '14 at 11:02
cactus314
15.4k42269
15.4k42269
13
A good approximation of order approx. $;10^{-7};$ ....that's all. There are literally thousands of different such approximations to all kinds of numbers.
– DonAntonio
Jun 14 '14 at 11:07
4
This is most likely a coincidence, as the approximation is explained well by a long-known astonishing coincidence $pi approx e^pi - 20$. For example, $log(pi^4 + pi^5) = 4log(pi)+log(1+pi)$ and applying the above with the crude estimation $exp(pi) approx 23$ in mind, one has $log(pi) approx log(exp(pi)-20) approx pi + log(1-20/exp(pi)) approx pi + log(3/23)$ and similarly $log(1+pi) approx log(exp(pi) - 19) approx pi + log(4/23)$. Adding up, we have $5pi + log(3^4/23^4cdot 4/23) approx 5.811$ which is much close to $6$.
– Balarka Sen
Jun 14 '14 at 12:23
3
Is there a question here?
– Alexander Gruber♦
Jun 14 '14 at 12:48
5
@johnmangual I see a question mark but the words behind it do not make sense. Please clarify your meaning of "is this pigeonhole" as requested.
– Alexander Gruber♦
Jun 14 '14 at 16:10
3
$piapproxdfrac{ln(640320^3+744)}{sqrt{163}}$ , with a precision of $30$ exact decimals. Discovered independently by both Charles Hermite and Srinivasa Ramanujan. Based on the fact that $e^{pisqrt H}$ is an almost integer when H is a Heegner number.
– Lucian
Jun 14 '14 at 17:23
|
show 6 more comments
13
A good approximation of order approx. $;10^{-7};$ ....that's all. There are literally thousands of different such approximations to all kinds of numbers.
– DonAntonio
Jun 14 '14 at 11:07
4
This is most likely a coincidence, as the approximation is explained well by a long-known astonishing coincidence $pi approx e^pi - 20$. For example, $log(pi^4 + pi^5) = 4log(pi)+log(1+pi)$ and applying the above with the crude estimation $exp(pi) approx 23$ in mind, one has $log(pi) approx log(exp(pi)-20) approx pi + log(1-20/exp(pi)) approx pi + log(3/23)$ and similarly $log(1+pi) approx log(exp(pi) - 19) approx pi + log(4/23)$. Adding up, we have $5pi + log(3^4/23^4cdot 4/23) approx 5.811$ which is much close to $6$.
– Balarka Sen
Jun 14 '14 at 12:23
3
Is there a question here?
– Alexander Gruber♦
Jun 14 '14 at 12:48
5
@johnmangual I see a question mark but the words behind it do not make sense. Please clarify your meaning of "is this pigeonhole" as requested.
– Alexander Gruber♦
Jun 14 '14 at 16:10
3
$piapproxdfrac{ln(640320^3+744)}{sqrt{163}}$ , with a precision of $30$ exact decimals. Discovered independently by both Charles Hermite and Srinivasa Ramanujan. Based on the fact that $e^{pisqrt H}$ is an almost integer when H is a Heegner number.
– Lucian
Jun 14 '14 at 17:23
13
13
A good approximation of order approx. $;10^{-7};$ ....that's all. There are literally thousands of different such approximations to all kinds of numbers.
– DonAntonio
Jun 14 '14 at 11:07
A good approximation of order approx. $;10^{-7};$ ....that's all. There are literally thousands of different such approximations to all kinds of numbers.
– DonAntonio
Jun 14 '14 at 11:07
4
4
This is most likely a coincidence, as the approximation is explained well by a long-known astonishing coincidence $pi approx e^pi - 20$. For example, $log(pi^4 + pi^5) = 4log(pi)+log(1+pi)$ and applying the above with the crude estimation $exp(pi) approx 23$ in mind, one has $log(pi) approx log(exp(pi)-20) approx pi + log(1-20/exp(pi)) approx pi + log(3/23)$ and similarly $log(1+pi) approx log(exp(pi) - 19) approx pi + log(4/23)$. Adding up, we have $5pi + log(3^4/23^4cdot 4/23) approx 5.811$ which is much close to $6$.
– Balarka Sen
Jun 14 '14 at 12:23
This is most likely a coincidence, as the approximation is explained well by a long-known astonishing coincidence $pi approx e^pi - 20$. For example, $log(pi^4 + pi^5) = 4log(pi)+log(1+pi)$ and applying the above with the crude estimation $exp(pi) approx 23$ in mind, one has $log(pi) approx log(exp(pi)-20) approx pi + log(1-20/exp(pi)) approx pi + log(3/23)$ and similarly $log(1+pi) approx log(exp(pi) - 19) approx pi + log(4/23)$. Adding up, we have $5pi + log(3^4/23^4cdot 4/23) approx 5.811$ which is much close to $6$.
– Balarka Sen
Jun 14 '14 at 12:23
3
3
Is there a question here?
– Alexander Gruber♦
Jun 14 '14 at 12:48
Is there a question here?
– Alexander Gruber♦
Jun 14 '14 at 12:48
5
5
@johnmangual I see a question mark but the words behind it do not make sense. Please clarify your meaning of "is this pigeonhole" as requested.
– Alexander Gruber♦
Jun 14 '14 at 16:10
@johnmangual I see a question mark but the words behind it do not make sense. Please clarify your meaning of "is this pigeonhole" as requested.
– Alexander Gruber♦
Jun 14 '14 at 16:10
3
3
$piapproxdfrac{ln(640320^3+744)}{sqrt{163}}$ , with a precision of $30$ exact decimals. Discovered independently by both Charles Hermite and Srinivasa Ramanujan. Based on the fact that $e^{pisqrt H}$ is an almost integer when H is a Heegner number.
– Lucian
Jun 14 '14 at 17:23
$piapproxdfrac{ln(640320^3+744)}{sqrt{163}}$ , with a precision of $30$ exact decimals. Discovered independently by both Charles Hermite and Srinivasa Ramanujan. Based on the fact that $e^{pisqrt H}$ is an almost integer when H is a Heegner number.
– Lucian
Jun 14 '14 at 17:23
|
show 6 more comments
1 Answer
1
active
oldest
votes
Well known approximations for $pi$, $pi^2$ and $pi^3$ can be related to the question.
$$e^6 approx 403 = 13·31 = (3+10)·31 approx left(pi+pi^2right)pi^3= pi^4+pi^5$$
The approximations $pi approx 3$ and $pi^2 approx 10$ have similar absolute errors with opposite sign so the combination $pi+pi^2 approx 13$ is more precise. The largest root of the polynomial $x^2+x-13$ is $frac{sqrt{53}-1}{2}=3.140$, which approximates $pi$ with an accuracy between that of $sqrt{10}$ (one digit) and $31^frac{1}{3}$ (three digits).
this is the right idea. i think the best way is to use Poisson summation and truncate. usually one side or the other converges quickly
– cactus314
Apr 15 '17 at 14:27
1
Do you mean that there is a series $$left(frac{e^3}{pi^2}right)^2 = sum_{n=0}^{infty} k_npi^n$$ with $k_0=k_1=1$ and the other $k_n$ very small?
– Jaume Oliver Lafont
Apr 15 '17 at 15:30
add a comment |
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%2f833800%2fpi4-pi5-approx-e6-is-anything-special-going-on-here%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Well known approximations for $pi$, $pi^2$ and $pi^3$ can be related to the question.
$$e^6 approx 403 = 13·31 = (3+10)·31 approx left(pi+pi^2right)pi^3= pi^4+pi^5$$
The approximations $pi approx 3$ and $pi^2 approx 10$ have similar absolute errors with opposite sign so the combination $pi+pi^2 approx 13$ is more precise. The largest root of the polynomial $x^2+x-13$ is $frac{sqrt{53}-1}{2}=3.140$, which approximates $pi$ with an accuracy between that of $sqrt{10}$ (one digit) and $31^frac{1}{3}$ (three digits).
this is the right idea. i think the best way is to use Poisson summation and truncate. usually one side or the other converges quickly
– cactus314
Apr 15 '17 at 14:27
1
Do you mean that there is a series $$left(frac{e^3}{pi^2}right)^2 = sum_{n=0}^{infty} k_npi^n$$ with $k_0=k_1=1$ and the other $k_n$ very small?
– Jaume Oliver Lafont
Apr 15 '17 at 15:30
add a comment |
Well known approximations for $pi$, $pi^2$ and $pi^3$ can be related to the question.
$$e^6 approx 403 = 13·31 = (3+10)·31 approx left(pi+pi^2right)pi^3= pi^4+pi^5$$
The approximations $pi approx 3$ and $pi^2 approx 10$ have similar absolute errors with opposite sign so the combination $pi+pi^2 approx 13$ is more precise. The largest root of the polynomial $x^2+x-13$ is $frac{sqrt{53}-1}{2}=3.140$, which approximates $pi$ with an accuracy between that of $sqrt{10}$ (one digit) and $31^frac{1}{3}$ (three digits).
this is the right idea. i think the best way is to use Poisson summation and truncate. usually one side or the other converges quickly
– cactus314
Apr 15 '17 at 14:27
1
Do you mean that there is a series $$left(frac{e^3}{pi^2}right)^2 = sum_{n=0}^{infty} k_npi^n$$ with $k_0=k_1=1$ and the other $k_n$ very small?
– Jaume Oliver Lafont
Apr 15 '17 at 15:30
add a comment |
Well known approximations for $pi$, $pi^2$ and $pi^3$ can be related to the question.
$$e^6 approx 403 = 13·31 = (3+10)·31 approx left(pi+pi^2right)pi^3= pi^4+pi^5$$
The approximations $pi approx 3$ and $pi^2 approx 10$ have similar absolute errors with opposite sign so the combination $pi+pi^2 approx 13$ is more precise. The largest root of the polynomial $x^2+x-13$ is $frac{sqrt{53}-1}{2}=3.140$, which approximates $pi$ with an accuracy between that of $sqrt{10}$ (one digit) and $31^frac{1}{3}$ (three digits).
Well known approximations for $pi$, $pi^2$ and $pi^3$ can be related to the question.
$$e^6 approx 403 = 13·31 = (3+10)·31 approx left(pi+pi^2right)pi^3= pi^4+pi^5$$
The approximations $pi approx 3$ and $pi^2 approx 10$ have similar absolute errors with opposite sign so the combination $pi+pi^2 approx 13$ is more precise. The largest root of the polynomial $x^2+x-13$ is $frac{sqrt{53}-1}{2}=3.140$, which approximates $pi$ with an accuracy between that of $sqrt{10}$ (one digit) and $31^frac{1}{3}$ (three digits).
edited Apr 15 '17 at 9:18
answered Apr 15 '17 at 8:48
Jaume Oliver Lafont
3,09211033
3,09211033
this is the right idea. i think the best way is to use Poisson summation and truncate. usually one side or the other converges quickly
– cactus314
Apr 15 '17 at 14:27
1
Do you mean that there is a series $$left(frac{e^3}{pi^2}right)^2 = sum_{n=0}^{infty} k_npi^n$$ with $k_0=k_1=1$ and the other $k_n$ very small?
– Jaume Oliver Lafont
Apr 15 '17 at 15:30
add a comment |
this is the right idea. i think the best way is to use Poisson summation and truncate. usually one side or the other converges quickly
– cactus314
Apr 15 '17 at 14:27
1
Do you mean that there is a series $$left(frac{e^3}{pi^2}right)^2 = sum_{n=0}^{infty} k_npi^n$$ with $k_0=k_1=1$ and the other $k_n$ very small?
– Jaume Oliver Lafont
Apr 15 '17 at 15:30
this is the right idea. i think the best way is to use Poisson summation and truncate. usually one side or the other converges quickly
– cactus314
Apr 15 '17 at 14:27
this is the right idea. i think the best way is to use Poisson summation and truncate. usually one side or the other converges quickly
– cactus314
Apr 15 '17 at 14:27
1
1
Do you mean that there is a series $$left(frac{e^3}{pi^2}right)^2 = sum_{n=0}^{infty} k_npi^n$$ with $k_0=k_1=1$ and the other $k_n$ very small?
– Jaume Oliver Lafont
Apr 15 '17 at 15:30
Do you mean that there is a series $$left(frac{e^3}{pi^2}right)^2 = sum_{n=0}^{infty} k_npi^n$$ with $k_0=k_1=1$ and the other $k_n$ very small?
– Jaume Oliver Lafont
Apr 15 '17 at 15:30
add a comment |
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f833800%2fpi4-pi5-approx-e6-is-anything-special-going-on-here%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
13
A good approximation of order approx. $;10^{-7};$ ....that's all. There are literally thousands of different such approximations to all kinds of numbers.
– DonAntonio
Jun 14 '14 at 11:07
4
This is most likely a coincidence, as the approximation is explained well by a long-known astonishing coincidence $pi approx e^pi - 20$. For example, $log(pi^4 + pi^5) = 4log(pi)+log(1+pi)$ and applying the above with the crude estimation $exp(pi) approx 23$ in mind, one has $log(pi) approx log(exp(pi)-20) approx pi + log(1-20/exp(pi)) approx pi + log(3/23)$ and similarly $log(1+pi) approx log(exp(pi) - 19) approx pi + log(4/23)$. Adding up, we have $5pi + log(3^4/23^4cdot 4/23) approx 5.811$ which is much close to $6$.
– Balarka Sen
Jun 14 '14 at 12:23
3
Is there a question here?
– Alexander Gruber♦
Jun 14 '14 at 12:48
5
@johnmangual I see a question mark but the words behind it do not make sense. Please clarify your meaning of "is this pigeonhole" as requested.
– Alexander Gruber♦
Jun 14 '14 at 16:10
3
$piapproxdfrac{ln(640320^3+744)}{sqrt{163}}$ , with a precision of $30$ exact decimals. Discovered independently by both Charles Hermite and Srinivasa Ramanujan. Based on the fact that $e^{pisqrt H}$ is an almost integer when H is a Heegner number.
– Lucian
Jun 14 '14 at 17:23