Converting Python code into Basic Code v1.1Generating a list of primes of a given lengthSimplify a...
What would be the benefits of having both a state and local currencies?
How does it work when somebody invests in my business?
How was Earth single-handedly capable of creating 3 of the 4 gods of chaos?
What is the opposite of 'gravitas'?
How to combine multiple text files of different lengths and multiple columns by a column
Finding all intervals that match predicate in vector
How do I define a right arrow with bar in LaTeX?
What is the intuitive meaning of having a linear relationship between the logs of two variables?
What is the term when two people sing in harmony, but they aren't singing the same notes?
How do I rename a LINUX host without needing to reboot for the rename to take effect?
Bash method for viewing beginning and end of file
Minimal reference content
How to be diplomatic in refusing to write code that breaches the privacy of our users
Print name if parameter passed to function
What's a natural way to say that someone works somewhere (for a job)?
What will be the benefits of Brexit?
Trouble understanding overseas colleagues
What are the ramifications of creating a homebrew world without an Astral Plane?
Why Were Madagascar and New Zealand Discovered So Late?
What is the oldest known work of fiction?
How to verify if g is a generator for p?
Student evaluations of teaching assistants
How do I keep an essay about "feeling flat" from feeling flat?
Cynical novel that describes an America ruled by the media, arms manufacturers, and ethnic figureheads
Converting Python code into Basic Code v1.1
Generating a list of primes of a given lengthSimplify a fractionCount occurrence of words in a .txt fileRandom Contraction Min Cut (Karger) - performance issuesCount numbers with atleast one common factor, excluding one (updated)Return a minimum number of ranges from a collection of rangesPython Natas solverSpeeding up Buddhabrot calculation in PyCudaFirst encryption programScraping Instagram for Hashtag data
$begingroup$
I've been studying the Basic programming language for a few weeks and I was wondering how I would write Pollard's rho algorithm into a Basic script.
Note:I'm referring to the old 1980s programming language.
def gcd(a, b):
while a % b != 0:
a, b = b, a % b
return b
number = 10403
x_fixed = 2
cycle_size = 2
x = 2
factor = 1
while factor == 1:
count = 1
while count <= cycle_size and factor <= 1:
x = (x*x + 1) % number
factor = gcd(x - x_fixed, number)
count += 1
cycle_size *= 2
x_fixed = x
print(factor)
python basic-lang
asked 3 mins ago
Travis WellsTravis Wells
113
$endgroup$
add a comment |
$begingroup$
I've been studying the Basic programming language for a few weeks and I was wondering how I would write Pollard's rho algorithm into a Basic script.
Note:I'm referring to the old 1980s programming language.
def gcd(a, b):
while a % b != 0:
a, b = b, a % b
return b
number = 10403
x_fixed = 2
cycle_size = 2
x = 2
factor = 1
while factor == 1:
count = 1
while count <= cycle_size and factor <= 1:
x = (x*x + 1) % number
factor = gcd(x - x_fixed, number)
count += 1
cycle_size *= 2
x_fixed = x
print(factor)
python basic-lang
asked 3 mins ago
Travis WellsTravis Wells
113
$endgroup$
add a comment |
$begingroup$
I've been studying the Basic programming language for a few weeks and I was wondering how I would write Pollard's rho algorithm into a Basic script.
Note:I'm referring to the old 1980s programming language.
def gcd(a, b):
while a % b != 0:
a, b = b, a % b
return b
number = 10403
x_fixed = 2
cycle_size = 2
x = 2
factor = 1
while factor == 1:
count = 1
while count <= cycle_size and factor <= 1:
x = (x*x + 1) % number
factor = gcd(x - x_fixed, number)
count += 1
cycle_size *= 2
x_fixed = x
print(factor)
python basic-lang
asked 3 mins ago
Travis WellsTravis Wells
113
$endgroup$
I've been studying the Basic programming language for a few weeks and I was wondering how I would write Pollard's rho algorithm into a Basic script.
Note:I'm referring to the old 1980s programming language.
def gcd(a, b):
while a % b != 0:
a, b = b, a % b
return b
number = 10403
x_fixed = 2
cycle_size = 2
x = 2
factor = 1
while factor == 1:
count = 1
while count <= cycle_size and factor <= 1:
x = (x*x + 1) % number
factor = gcd(x - x_fixed, number)
count += 1
cycle_size *= 2
x_fixed = x
print(factor)
python basic-lang
python basic-lang
asked 3 mins ago
Travis WellsTravis Wells
113
asked 3 mins ago
Travis WellsTravis Wells
113
asked 3 mins ago
Travis WellsTravis Wells
113
asked 3 mins ago
Travis WellsTravis Wells
113
asked 3 mins ago
Travis WellsTravis Wells
113
113
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
});
}
});
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%2f216305%2fconverting-python-code-into-basic-code-v1-1%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 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%2f216305%2fconverting-python-code-into-basic-code-v1-1%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
