Ponzi Scheme Calculator
$begingroup$
I'm trying to write a Efficient Ponzi scheme calculator that when given: the initial amount invested, maximum number of recruits that a recruiter may have, the entry fee and the percentage of the entry fee each recruiter can keep. It returns minimum number of persons that must be recruited for the initial investment may be recouped.
n: the number of dollars invested
b: the maximum number of recruits that a recruiter may have
m: the entry fee
r: the percentage of earnings each recruiter is allowed to keep.
Here is the Code I have written:
def findNumPersons(n, b, m, r):
money=b*m
counter=b
while money<n:
money+=m*((100-r)/100)
counter+=1
return counter
My challenge is that as n get larger and (b,m,r) get smaller it takes longer to calculate the minimum amount of persons.
python
asked 24 mins ago
GeddezGeddez
1
New contributor
Geddez is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I'm trying to write a Efficient Ponzi scheme calculator that when given: the initial amount invested, maximum number of recruits that a recruiter may have, the entry fee and the percentage of the entry fee each recruiter can keep. It returns minimum number of persons that must be recruited for the initial investment may be recouped.
n: the number of dollars invested
b: the maximum number of recruits that a recruiter may have
m: the entry fee
r: the percentage of earnings each recruiter is allowed to keep.
Here is the Code I have written:
def findNumPersons(n, b, m, r):
money=b*m
counter=b
while money<n:
money+=m*((100-r)/100)
counter+=1
return counter
My challenge is that as n get larger and (b,m,r) get smaller it takes longer to calculate the minimum amount of persons.
python
asked 24 mins ago
GeddezGeddez
1
New contributor
Geddez is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I'm trying to write a Efficient Ponzi scheme calculator that when given: the initial amount invested, maximum number of recruits that a recruiter may have, the entry fee and the percentage of the entry fee each recruiter can keep. It returns minimum number of persons that must be recruited for the initial investment may be recouped.
n: the number of dollars invested
b: the maximum number of recruits that a recruiter may have
m: the entry fee
r: the percentage of earnings each recruiter is allowed to keep.
Here is the Code I have written:
def findNumPersons(n, b, m, r):
money=b*m
counter=b
while money<n:
money+=m*((100-r)/100)
counter+=1
return counter
My challenge is that as n get larger and (b,m,r) get smaller it takes longer to calculate the minimum amount of persons.
python
asked 24 mins ago
GeddezGeddez
1
New contributor
Geddez is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I'm trying to write a Efficient Ponzi scheme calculator that when given: the initial amount invested, maximum number of recruits that a recruiter may have, the entry fee and the percentage of the entry fee each recruiter can keep. It returns minimum number of persons that must be recruited for the initial investment may be recouped.
n: the number of dollars invested
b: the maximum number of recruits that a recruiter may have
m: the entry fee
r: the percentage of earnings each recruiter is allowed to keep.
Here is the Code I have written:
def findNumPersons(n, b, m, r):
money=b*m
counter=b
while money<n:
money+=m*((100-r)/100)
counter+=1
return counter
My challenge is that as n get larger and (b,m,r) get smaller it takes longer to calculate the minimum amount of persons.
python
python
asked 24 mins ago
GeddezGeddez
1
New contributor
Geddez is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 24 mins ago
GeddezGeddez
1
New contributor
Geddez is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 24 mins ago
GeddezGeddez
1
New contributor
Geddez is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 24 mins ago
GeddezGeddez
1
asked 24 mins ago
GeddezGeddez
1
1
New contributor
Geddez is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Geddez is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Geddez is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
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.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Geddez is a new contributor. Be nice, and check out our Code of Conduct.
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%2fcodereview.stackexchange.com%2fquestions%2f213556%2fponzi-scheme-calculator%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
Geddez is a new contributor. Be nice, and check out our Code of Conduct.
Geddez is a new contributor. Be nice, and check out our Code of Conduct.
Geddez is a new contributor. Be nice, and check out our Code of Conduct.
Geddez is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review 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%2fcodereview.stackexchange.com%2fquestions%2f213556%2fponzi-scheme-calculator%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
