How to find factors when factoring
up vote
1
down vote
favorite
I'm going to be a TA in an introductory course in mathematics at a technical university this fall, focusing on mathematics that the students should already be familiar with but that might need refreshing before the courses in linear algebra and calculus start.
One of the things in the course is basic factorization - both for integers and polynomials. I don't think anyone will have trouble finding the first few primes such as $2$, $3$ and $5$, but it got me thinking as to whether there is a systematic approach when trying to factor slightly higher primes such as $17$ or $31$.
Generally if I happen to be doing integer factorization I try to "feel" which prime might be possible to factor out, but that is not a very helpful thing to tell students.
Is there a better method to quickly find the factors? Obviously excluding calculators, computers and the such.
edit: Quick example exercise
Perform integer factorization on $2108$.
It is obvious that
$2108 = 2 * 2 * 527$.
However is there a method for quickly finding the two remaining factors, $17$ and $31$? Just by looking at $527$, I would say it is not apparent to most people which prime numbers (or even what range beyond the double digits) to start trying.
prime-factorization
|
show 2 more comments
up vote
1
down vote
favorite
I'm going to be a TA in an introductory course in mathematics at a technical university this fall, focusing on mathematics that the students should already be familiar with but that might need refreshing before the courses in linear algebra and calculus start.
One of the things in the course is basic factorization - both for integers and polynomials. I don't think anyone will have trouble finding the first few primes such as $2$, $3$ and $5$, but it got me thinking as to whether there is a systematic approach when trying to factor slightly higher primes such as $17$ or $31$.
Generally if I happen to be doing integer factorization I try to "feel" which prime might be possible to factor out, but that is not a very helpful thing to tell students.
Is there a better method to quickly find the factors? Obviously excluding calculators, computers and the such.
edit: Quick example exercise
Perform integer factorization on $2108$.
It is obvious that
$2108 = 2 * 2 * 527$.
However is there a method for quickly finding the two remaining factors, $17$ and $31$? Just by looking at $527$, I would say it is not apparent to most people which prime numbers (or even what range beyond the double digits) to start trying.
prime-factorization
For finding primes: Sieve of Eratosthenes See wikipedia: en.wikipedia.org/wiki/Sieve_of_Eratosthenes
– William
Jul 29 '14 at 12:28
Also computationally, all known algorithms for factorization are fairly slow in a technical sense. Practically, if you know all the primes below the square root of a number, you can avoid some computation.
– William
Jul 29 '14 at 12:34
Have you read the Wikipedia page on integer factorization?
– Bill Dubuque
Jul 29 '14 at 13:00
"...when trying to factor slightly higher primes such as 17 or 31." Factoring primes is trivial. What you meant was, finding slightly higher prime factors. If you're going to teach, I beg you to say to your students exactly what you mean, and not something sorta kinda like what you mean. They will find the mathematics hard enough, without having to decipher sloppy statements of problems, definitions, solutions, and so on.
– Gerry Myerson
Jul 29 '14 at 13:14
Thank you for helping me improve. I will not be teaching in English, nor is English my first language.
– abberg
Jul 29 '14 at 13:45
|
show 2 more comments
up vote
1
down vote
favorite
up vote
1
down vote
favorite
I'm going to be a TA in an introductory course in mathematics at a technical university this fall, focusing on mathematics that the students should already be familiar with but that might need refreshing before the courses in linear algebra and calculus start.
One of the things in the course is basic factorization - both for integers and polynomials. I don't think anyone will have trouble finding the first few primes such as $2$, $3$ and $5$, but it got me thinking as to whether there is a systematic approach when trying to factor slightly higher primes such as $17$ or $31$.
Generally if I happen to be doing integer factorization I try to "feel" which prime might be possible to factor out, but that is not a very helpful thing to tell students.
Is there a better method to quickly find the factors? Obviously excluding calculators, computers and the such.
edit: Quick example exercise
Perform integer factorization on $2108$.
It is obvious that
$2108 = 2 * 2 * 527$.
However is there a method for quickly finding the two remaining factors, $17$ and $31$? Just by looking at $527$, I would say it is not apparent to most people which prime numbers (or even what range beyond the double digits) to start trying.
prime-factorization
I'm going to be a TA in an introductory course in mathematics at a technical university this fall, focusing on mathematics that the students should already be familiar with but that might need refreshing before the courses in linear algebra and calculus start.
One of the things in the course is basic factorization - both for integers and polynomials. I don't think anyone will have trouble finding the first few primes such as $2$, $3$ and $5$, but it got me thinking as to whether there is a systematic approach when trying to factor slightly higher primes such as $17$ or $31$.
Generally if I happen to be doing integer factorization I try to "feel" which prime might be possible to factor out, but that is not a very helpful thing to tell students.
Is there a better method to quickly find the factors? Obviously excluding calculators, computers and the such.
edit: Quick example exercise
Perform integer factorization on $2108$.
It is obvious that
$2108 = 2 * 2 * 527$.
However is there a method for quickly finding the two remaining factors, $17$ and $31$? Just by looking at $527$, I would say it is not apparent to most people which prime numbers (or even what range beyond the double digits) to start trying.
prime-factorization
prime-factorization
edited Nov 23 at 11:25
Klangen
1,50811232
1,50811232
asked Jul 29 '14 at 12:27
abberg
63
63
For finding primes: Sieve of Eratosthenes See wikipedia: en.wikipedia.org/wiki/Sieve_of_Eratosthenes
– William
Jul 29 '14 at 12:28
Also computationally, all known algorithms for factorization are fairly slow in a technical sense. Practically, if you know all the primes below the square root of a number, you can avoid some computation.
– William
Jul 29 '14 at 12:34
Have you read the Wikipedia page on integer factorization?
– Bill Dubuque
Jul 29 '14 at 13:00
"...when trying to factor slightly higher primes such as 17 or 31." Factoring primes is trivial. What you meant was, finding slightly higher prime factors. If you're going to teach, I beg you to say to your students exactly what you mean, and not something sorta kinda like what you mean. They will find the mathematics hard enough, without having to decipher sloppy statements of problems, definitions, solutions, and so on.
– Gerry Myerson
Jul 29 '14 at 13:14
Thank you for helping me improve. I will not be teaching in English, nor is English my first language.
– abberg
Jul 29 '14 at 13:45
|
show 2 more comments
For finding primes: Sieve of Eratosthenes See wikipedia: en.wikipedia.org/wiki/Sieve_of_Eratosthenes
– William
Jul 29 '14 at 12:28
Also computationally, all known algorithms for factorization are fairly slow in a technical sense. Practically, if you know all the primes below the square root of a number, you can avoid some computation.
– William
Jul 29 '14 at 12:34
Have you read the Wikipedia page on integer factorization?
– Bill Dubuque
Jul 29 '14 at 13:00
"...when trying to factor slightly higher primes such as 17 or 31." Factoring primes is trivial. What you meant was, finding slightly higher prime factors. If you're going to teach, I beg you to say to your students exactly what you mean, and not something sorta kinda like what you mean. They will find the mathematics hard enough, without having to decipher sloppy statements of problems, definitions, solutions, and so on.
– Gerry Myerson
Jul 29 '14 at 13:14
Thank you for helping me improve. I will not be teaching in English, nor is English my first language.
– abberg
Jul 29 '14 at 13:45
For finding primes: Sieve of Eratosthenes See wikipedia: en.wikipedia.org/wiki/Sieve_of_Eratosthenes
– William
Jul 29 '14 at 12:28
For finding primes: Sieve of Eratosthenes See wikipedia: en.wikipedia.org/wiki/Sieve_of_Eratosthenes
– William
Jul 29 '14 at 12:28
Also computationally, all known algorithms for factorization are fairly slow in a technical sense. Practically, if you know all the primes below the square root of a number, you can avoid some computation.
– William
Jul 29 '14 at 12:34
Also computationally, all known algorithms for factorization are fairly slow in a technical sense. Practically, if you know all the primes below the square root of a number, you can avoid some computation.
– William
Jul 29 '14 at 12:34
Have you read the Wikipedia page on integer factorization?
– Bill Dubuque
Jul 29 '14 at 13:00
Have you read the Wikipedia page on integer factorization?
– Bill Dubuque
Jul 29 '14 at 13:00
"...when trying to factor slightly higher primes such as 17 or 31." Factoring primes is trivial. What you meant was, finding slightly higher prime factors. If you're going to teach, I beg you to say to your students exactly what you mean, and not something sorta kinda like what you mean. They will find the mathematics hard enough, without having to decipher sloppy statements of problems, definitions, solutions, and so on.
– Gerry Myerson
Jul 29 '14 at 13:14
"...when trying to factor slightly higher primes such as 17 or 31." Factoring primes is trivial. What you meant was, finding slightly higher prime factors. If you're going to teach, I beg you to say to your students exactly what you mean, and not something sorta kinda like what you mean. They will find the mathematics hard enough, without having to decipher sloppy statements of problems, definitions, solutions, and so on.
– Gerry Myerson
Jul 29 '14 at 13:14
Thank you for helping me improve. I will not be teaching in English, nor is English my first language.
– abberg
Jul 29 '14 at 13:45
Thank you for helping me improve. I will not be teaching in English, nor is English my first language.
– abberg
Jul 29 '14 at 13:45
|
show 2 more comments
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%2f881479%2fhow-to-find-factors-when-factoring%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
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.
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%2f881479%2fhow-to-find-factors-when-factoring%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
For finding primes: Sieve of Eratosthenes See wikipedia: en.wikipedia.org/wiki/Sieve_of_Eratosthenes
– William
Jul 29 '14 at 12:28
Also computationally, all known algorithms for factorization are fairly slow in a technical sense. Practically, if you know all the primes below the square root of a number, you can avoid some computation.
– William
Jul 29 '14 at 12:34
Have you read the Wikipedia page on integer factorization?
– Bill Dubuque
Jul 29 '14 at 13:00
"...when trying to factor slightly higher primes such as 17 or 31." Factoring primes is trivial. What you meant was, finding slightly higher prime factors. If you're going to teach, I beg you to say to your students exactly what you mean, and not something sorta kinda like what you mean. They will find the mathematics hard enough, without having to decipher sloppy statements of problems, definitions, solutions, and so on.
– Gerry Myerson
Jul 29 '14 at 13:14
Thank you for helping me improve. I will not be teaching in English, nor is English my first language.
– abberg
Jul 29 '14 at 13:45