Mixing
![How can you save variables and load them after the program is closed? [closed]](https://lh3.googleusercontent.com/-dk4siIkSG1g/AAAAAAAAAAI/AAAAAAAACIs/lFIYjEzoBf4/s72-c/photo.jpg?sz=32)
How to do Monte Carlo Method for exceedingly large numbers?
$begingroup$
For a paper I'm writing for my math class, I need to do several Monte Carlo simulations for a game I'm playing. The $p=0.6190411273$, a normal number... but the $n=2.14974(10^{10})$. I've tried to run a simple Monte Carlo simulation on my TI-84, but it flat-out refuses to do a simulation that big. Does anyone know how I would go about doing a Monte Carlo simulation for such a large number of trials?
monte-carlo simulation calculator
asked Jan 15 at 19:23
Drew WeissermanDrew Weisserman
205
$endgroup$
add a comment |
$begingroup$
For a paper I'm writing for my math class, I need to do several Monte Carlo simulations for a game I'm playing. The $p=0.6190411273$, a normal number... but the $n=2.14974(10^{10})$. I've tried to run a simple Monte Carlo simulation on my TI-84, but it flat-out refuses to do a simulation that big. Does anyone know how I would go about doing a Monte Carlo simulation for such a large number of trials?
monte-carlo simulation calculator
asked Jan 15 at 19:23
Drew WeissermanDrew Weisserman
205
$endgroup$
$begingroup$
1) Get the largest computing resources you can find (including multi-core machines), 2) Break the problem into portions of $n$, 3) Use optimized code.
$endgroup$
– David G. Stork
Jan 15 at 19:25
$begingroup$
Even if you can do a million simulations per second, this will take over 5 hours. What is the largest $n$ your calculator can handle?
$endgroup$
– copper.hat
Jan 15 at 19:33
$begingroup$
It is difficult to give an advice without more information on the simulation. First try to find a solution at the algorithmic level
$endgroup$
– Damien
Jan 15 at 20:34
add a comment |
$begingroup$
For a paper I'm writing for my math class, I need to do several Monte Carlo simulations for a game I'm playing. The $p=0.6190411273$, a normal number... but the $n=2.14974(10^{10})$. I've tried to run a simple Monte Carlo simulation on my TI-84, but it flat-out refuses to do a simulation that big. Does anyone know how I would go about doing a Monte Carlo simulation for such a large number of trials?
monte-carlo simulation calculator
asked Jan 15 at 19:23
Drew WeissermanDrew Weisserman
205
$endgroup$
For a paper I'm writing for my math class, I need to do several Monte Carlo simulations for a game I'm playing. The $p=0.6190411273$, a normal number... but the $n=2.14974(10^{10})$. I've tried to run a simple Monte Carlo simulation on my TI-84, but it flat-out refuses to do a simulation that big. Does anyone know how I would go about doing a Monte Carlo simulation for such a large number of trials?
monte-carlo simulation calculator
monte-carlo simulation calculator
asked Jan 15 at 19:23
Drew WeissermanDrew Weisserman
205
asked Jan 15 at 19:23
Drew WeissermanDrew Weisserman
205
asked Jan 15 at 19:23
Drew WeissermanDrew Weisserman
205
asked Jan 15 at 19:23
Drew WeissermanDrew Weisserman
205
asked Jan 15 at 19:23
Drew WeissermanDrew Weisserman
205
205
$begingroup$
1) Get the largest computing resources you can find (including multi-core machines), 2) Break the problem into portions of $n$, 3) Use optimized code.
$endgroup$
– David G. Stork
Jan 15 at 19:25
$begingroup$
Even if you can do a million simulations per second, this will take over 5 hours. What is the largest $n$ your calculator can handle?
$endgroup$
– copper.hat
Jan 15 at 19:33
$begingroup$
It is difficult to give an advice without more information on the simulation. First try to find a solution at the algorithmic level
$endgroup$
– Damien
Jan 15 at 20:34
add a comment |
$begingroup$
1) Get the largest computing resources you can find (including multi-core machines), 2) Break the problem into portions of $n$, 3) Use optimized code.
$endgroup$
– David G. Stork
Jan 15 at 19:25
$begingroup$
Even if you can do a million simulations per second, this will take over 5 hours. What is the largest $n$ your calculator can handle?
$endgroup$
– copper.hat
Jan 15 at 19:33
$begingroup$
It is difficult to give an advice without more information on the simulation. First try to find a solution at the algorithmic level
$endgroup$
– Damien
Jan 15 at 20:34
$begingroup$
1) Get the largest computing resources you can find (including multi-core machines), 2) Break the problem into portions of $n$, 3) Use optimized code.
$endgroup$
– David G. Stork
Jan 15 at 19:25
$begingroup$
1) Get the largest computing resources you can find (including multi-core machines), 2) Break the problem into portions of $n$, 3) Use optimized code.
$endgroup$
– David G. Stork
Jan 15 at 19:25
$begingroup$
Even if you can do a million simulations per second, this will take over 5 hours. What is the largest $n$ your calculator can handle?
$endgroup$
– copper.hat
Jan 15 at 19:33
$begingroup$
Even if you can do a million simulations per second, this will take over 5 hours. What is the largest $n$ your calculator can handle?
$endgroup$
– copper.hat
Jan 15 at 19:33
$begingroup$
It is difficult to give an advice without more information on the simulation. First try to find a solution at the algorithmic level
$endgroup$
– Damien
Jan 15 at 20:34
$begingroup$
It is difficult to give an advice without more information on the simulation. First try to find a solution at the algorithmic level
$endgroup$
– Damien
Jan 15 at 20:34
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%2f3074835%2fhow-to-do-monte-carlo-method-for-exceedingly-large-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%2f3074835%2fhow-to-do-monte-carlo-method-for-exceedingly-large-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
$begingroup$
1) Get the largest computing resources you can find (including multi-core machines), 2) Break the problem into portions of $n$, 3) Use optimized code.
$endgroup$
– David G. Stork
Jan 15 at 19:25
$begingroup$
Even if you can do a million simulations per second, this will take over 5 hours. What is the largest $n$ your calculator can handle?
$endgroup$
– copper.hat
Jan 15 at 19:33
$begingroup$
It is difficult to give an advice without more information on the simulation. First try to find a solution at the algorithmic level
$endgroup$
– Damien
Jan 15 at 20:34