Why does the statement “p is prime if it is divisible by only itself and 1” define only one prime number?Do we have negative prime numbers?In arbitrary commutative rings, what is the accepted definition of “associates”?Let $x$ be greater than $1$. Prove $x$ is prime if and only if for every integer $y$, either $gcd(x,y)=1$ or $xmid y$.Are zero and one relatively prime?How do I show that :$sigma(p^m)$ is divisible by $4$ if $m=4k+1$ , and $k$ is an integer number?Prove that there exist $n$ consecutive positive integers with the $i$th integer divisible by the $i$th primeRecall that an integer is said to be square-free if it is not divisible by the square of any prime. Prove that for any positive integer $n$…Is 2 both a prime and a highly composite number?Numbers which are divisible by the sum of their prime factors.Proving there exists a prime $q$ such that for every integer $n$, the number $n^p-p$ is not divisible by $q$.What should we define as a prime number, as some definitions don’t go into enough detail, and some seem over the top.How many ways can we define prime number?
How does the reference system of the Majjhima Nikaya work?
How do ground effect vehicles perform turns?
Is it possible to use .desktop files to open local pdf files on specific pages with a browser?
Hot bath for aluminium engine block and heads
Did arcade monitors have same pixel aspect ratio as TV sets?
A social experiment. What is the worst that can happen?
Varistor? Purpose and principle
My friend sent me a screenshot of a transaction hash, but when I search for it I find divergent data. What happened?
What's the difference between 違法 and 不法?
How should I respond when I lied about my education and the company finds out through background check?
Could the E-bike drivetrain wear down till needing replacement after 400 km?
Query about absorption line spectra
How to decide convergence of Integrals
When quoting, must I also copy hyphens used to divide words that continue on the next line?
Is a model fitted to data or is data fitted to a model?
Why we can't differentiate a polynomial equation as many times as we wish?
Extending the spectral theorem for bounded self adjoint operators to bounded normal operators
Difference between -| and |- in TikZ
Is there a conventional notation or name for the slip angle?
Indicating multiple different modes of speech (fantasy language or telepathy)
Proving a function is onto where f(x)=|x|.
Fuse symbol on toroidal transformer
If a character with the Alert feat rolls a crit fail on their Perception check, are they surprised?
Is camera lens focus an exact point or a range?
Why does the statement “p is prime if it is divisible by only itself and 1” define only one prime number?
Do we have negative prime numbers?In arbitrary commutative rings, what is the accepted definition of “associates”?Let $x$ be greater than $1$. Prove $x$ is prime if and only if for every integer $y$, either $gcd(x,y)=1$ or $xmid y$.Are zero and one relatively prime?How do I show that :$sigma(p^m)$ is divisible by $4$ if $m=4k+1$ , and $k$ is an integer number?Prove that there exist $n$ consecutive positive integers with the $i$th integer divisible by the $i$th primeRecall that an integer is said to be square-free if it is not divisible by the square of any prime. Prove that for any positive integer $n$…Is 2 both a prime and a highly composite number?Numbers which are divisible by the sum of their prime factors.Proving there exists a prime $q$ such that for every integer $n$, the number $n^p-p$ is not divisible by $q$.What should we define as a prime number, as some definitions don’t go into enough detail, and some seem over the top.How many ways can we define prime number?
$begingroup$
I'm having a bit of trouble understanding why this incorrect definition of primality only defines one prime number.
"p is prime if it is divisible by only itself and 1."
My understood definition of a prime number is a positive integer that has exactly 2 positive integer factors: 1 and itself. Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Sorry if my question is related to others, I am quite new to number theory and could not find any other resources that would help me with this specific problem.
elementary-number-theory prime-numbers divisibility
New contributor
Peter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
|
show 10 more comments
$begingroup$
I'm having a bit of trouble understanding why this incorrect definition of primality only defines one prime number.
"p is prime if it is divisible by only itself and 1."
My understood definition of a prime number is a positive integer that has exactly 2 positive integer factors: 1 and itself. Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Sorry if my question is related to others, I am quite new to number theory and could not find any other resources that would help me with this specific problem.
elementary-number-theory prime-numbers divisibility
New contributor
Peter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
1
$begingroup$
This related question may be helpful.
$endgroup$
– Brian
3 hours ago
2
$begingroup$
What do you mean “defines only one prime number”??
$endgroup$
– symplectomorphic
3 hours ago
1
$begingroup$
In my opinion your professor is wrong.
$endgroup$
– amsmath
3 hours ago
1
$begingroup$
That definition would be "wrong" because $1$ is divisible by $1$ and itself, but $1$ is not prime.
$endgroup$
– B.Swan
3 hours ago
2
$begingroup$
You should ask your professor what he or she meant. You are most likely interpreting what he or she said incorrectly.
$endgroup$
– symplectomorphic
3 hours ago
|
show 10 more comments
$begingroup$
I'm having a bit of trouble understanding why this incorrect definition of primality only defines one prime number.
"p is prime if it is divisible by only itself and 1."
My understood definition of a prime number is a positive integer that has exactly 2 positive integer factors: 1 and itself. Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Sorry if my question is related to others, I am quite new to number theory and could not find any other resources that would help me with this specific problem.
elementary-number-theory prime-numbers divisibility
New contributor
Peter 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 having a bit of trouble understanding why this incorrect definition of primality only defines one prime number.
"p is prime if it is divisible by only itself and 1."
My understood definition of a prime number is a positive integer that has exactly 2 positive integer factors: 1 and itself. Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Sorry if my question is related to others, I am quite new to number theory and could not find any other resources that would help me with this specific problem.
elementary-number-theory prime-numbers divisibility
elementary-number-theory prime-numbers divisibility
New contributor
Peter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Peter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 2 hours ago
Bill Dubuque
213k29195654
213k29195654
New contributor
Peter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 3 hours ago
PeterPeter
162
162
New contributor
Peter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Peter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Peter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
1
$begingroup$
This related question may be helpful.
$endgroup$
– Brian
3 hours ago
2
$begingroup$
What do you mean “defines only one prime number”??
$endgroup$
– symplectomorphic
3 hours ago
1
$begingroup$
In my opinion your professor is wrong.
$endgroup$
– amsmath
3 hours ago
1
$begingroup$
That definition would be "wrong" because $1$ is divisible by $1$ and itself, but $1$ is not prime.
$endgroup$
– B.Swan
3 hours ago
2
$begingroup$
You should ask your professor what he or she meant. You are most likely interpreting what he or she said incorrectly.
$endgroup$
– symplectomorphic
3 hours ago
|
show 10 more comments
1
$begingroup$
This related question may be helpful.
$endgroup$
– Brian
3 hours ago
2
$begingroup$
What do you mean “defines only one prime number”??
$endgroup$
– symplectomorphic
3 hours ago
1
$begingroup$
In my opinion your professor is wrong.
$endgroup$
– amsmath
3 hours ago
1
$begingroup$
That definition would be "wrong" because $1$ is divisible by $1$ and itself, but $1$ is not prime.
$endgroup$
– B.Swan
3 hours ago
2
$begingroup$
You should ask your professor what he or she meant. You are most likely interpreting what he or she said incorrectly.
$endgroup$
– symplectomorphic
3 hours ago
1
1
$begingroup$
This related question may be helpful.
$endgroup$
– Brian
3 hours ago
$begingroup$
This related question may be helpful.
$endgroup$
– Brian
3 hours ago
2
2
$begingroup$
What do you mean “defines only one prime number”??
$endgroup$
– symplectomorphic
3 hours ago
$begingroup$
What do you mean “defines only one prime number”??
$endgroup$
– symplectomorphic
3 hours ago
1
1
$begingroup$
In my opinion your professor is wrong.
$endgroup$
– amsmath
3 hours ago
$begingroup$
In my opinion your professor is wrong.
$endgroup$
– amsmath
3 hours ago
1
1
$begingroup$
That definition would be "wrong" because $1$ is divisible by $1$ and itself, but $1$ is not prime.
$endgroup$
– B.Swan
3 hours ago
$begingroup$
That definition would be "wrong" because $1$ is divisible by $1$ and itself, but $1$ is not prime.
$endgroup$
– B.Swan
3 hours ago
2
2
$begingroup$
You should ask your professor what he or she meant. You are most likely interpreting what he or she said incorrectly.
$endgroup$
– symplectomorphic
3 hours ago
$begingroup$
You should ask your professor what he or she meant. You are most likely interpreting what he or she said incorrectly.
$endgroup$
– symplectomorphic
3 hours ago
|
show 10 more comments
4 Answers
4
active
oldest
votes
$begingroup$
Usually, in beginning number theory, we work only in the natural numbers (usually including $0$) so there are no negative numbers in this context. Assuming that, the definition of "divisor" would include the fact that a divisor is a natural number, than therefore positive. Then the definition:
A (natural) number $p$ greater than $1$ is prime iff it is divisible only by itself and $1$.
The "greater than $1$" part is important, because we don't want $1$ to be prime. (Although, historically it was considered a prime.) The implicit positiveness of the potential divisors is also important.
Later in the course, you can extend these definitions of "prime" and "divisor" to include the negative integers and then you'll have to adjust your definitions a bit.
$endgroup$
add a comment |
$begingroup$
Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Actually is worse. There would be no prime numbers as for any $x in mathbb R$ then $x = n*frac xn$ for any integer $n$ so $x$ has infinitely many divisors and can't be prime. $3$ is not prime because $frac 32, frac 34, frac 35$, etc all divide $3$. (The definition of $a$ divides $b$ is that there exists an integer $k$ so that $b = ka$. There is nothing in the definition that says $a$ and $b$ are integers)
So.......
The definition of "Having only $1$ and itself as divisor" assumes that we are only considering natural numbers (i.e. positive integers) and even then we are considering $1$ and "itself" to be different.
This definition is not even considering negative numbers to be considered. Nor is it considering that that rational non integers can be divisors.
Which is okay. We just have to be specific. The following would be a perfectly acceptable definition:
A natural number is prime if it has exactly two natural divisors; itself and $1$.
We can extend it extend this to all integers by saying a prime in any integer other than $pm 1$ with only two positive integer divisors; $1$ and the absolute value of itself. ... or a prime number is an integer which can not be expressed as a product of two or more non-unit ($pm 1$) integers.
With more abstract algebraic concepts we can define primes more precisely as Flowers' answer and various comment links explain. These also allow for primes in systems other than just the integers.
$endgroup$
add a comment |
$begingroup$
Your definition is correct. The confusion is stemming is from the fact that fundamental results and definitions-- both in courses and in mathematics in general-- are often times stated without certain underlying hypotheses that are understood "automatically," whether for technically sound reasons or nothing better than "this is number theory so this is how we do it." I will address each of your statements.
"p is prime if it is divisible by only itself and 1."
This is the highly traditional definition of prime that is usually provided in number theory courses. This definition comes with an unstated condition that only positive divisors are considered. This is done to simplify and streamline many of the results in elementary number theory. (Notice in a similar vein how prime numbers are also usually only defined over the positive naturals. We never really hear about "negative primes," and we generally state that "2 is the only even prime," despite the fact that -2 also satisfies the same conditions.)
My understood definition of a prime number is a positive integer that has exactly 2 positive integer factors: 1 and itself.
Your definition is correct. In fact, your definition is actually more precise, and arguably "better," at least in the sense that it does not require the reader to "import" the assumption that only positive divisors are being considered in context.
Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Taken literally, yes, the first "traditional" definition of prime implies this statement, but of course as I said the traditional definition is importing the positive divisor assumption. So your statement is a humorous but untrue technicality-- we know -1 is not the only prime number. As I also mentioned earlier, we usually don't even allow primes to be negative.
New contributor
lagicol123015 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$
The precise way to define prime and irreducible elements in a commutative ring are given here and here. For the integers, the definitions are equivalent, so you can use either. Rephrasing the second link for integers:
A unit in a ring is an element that has a multiplicative inverse. In the integers, the only units are $1$ and $-1$. So a nonzero non-unit element of the integers is irreducible (prime) if it cannot be written as the product of two integers which are both non-units (not 1 or -1).
Note that this implies that negative primes exist. Unique factorization is defined up to multiplication by units.
$endgroup$
2
$begingroup$
Beware that the 2nd link only defines "irreducible" for integral domains. In more general rings there may be zero divisors, which forces common notions of "associate" to bifurcate into a few inequivalent notions. This variation percolates into related notions, e.g. "irreducib;e" - see this answer
$endgroup$
– Bill Dubuque
3 hours ago
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
);
);
Peter 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%2fmath.stackexchange.com%2fquestions%2f3160805%2fwhy-does-the-statement-p-is-prime-if-it-is-divisible-by-only-itself-and-1-defi%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Usually, in beginning number theory, we work only in the natural numbers (usually including $0$) so there are no negative numbers in this context. Assuming that, the definition of "divisor" would include the fact that a divisor is a natural number, than therefore positive. Then the definition:
A (natural) number $p$ greater than $1$ is prime iff it is divisible only by itself and $1$.
The "greater than $1$" part is important, because we don't want $1$ to be prime. (Although, historically it was considered a prime.) The implicit positiveness of the potential divisors is also important.
Later in the course, you can extend these definitions of "prime" and "divisor" to include the negative integers and then you'll have to adjust your definitions a bit.
$endgroup$
add a comment |
$begingroup$
Usually, in beginning number theory, we work only in the natural numbers (usually including $0$) so there are no negative numbers in this context. Assuming that, the definition of "divisor" would include the fact that a divisor is a natural number, than therefore positive. Then the definition:
A (natural) number $p$ greater than $1$ is prime iff it is divisible only by itself and $1$.
The "greater than $1$" part is important, because we don't want $1$ to be prime. (Although, historically it was considered a prime.) The implicit positiveness of the potential divisors is also important.
Later in the course, you can extend these definitions of "prime" and "divisor" to include the negative integers and then you'll have to adjust your definitions a bit.
$endgroup$
add a comment |
$begingroup$
Usually, in beginning number theory, we work only in the natural numbers (usually including $0$) so there are no negative numbers in this context. Assuming that, the definition of "divisor" would include the fact that a divisor is a natural number, than therefore positive. Then the definition:
A (natural) number $p$ greater than $1$ is prime iff it is divisible only by itself and $1$.
The "greater than $1$" part is important, because we don't want $1$ to be prime. (Although, historically it was considered a prime.) The implicit positiveness of the potential divisors is also important.
Later in the course, you can extend these definitions of "prime" and "divisor" to include the negative integers and then you'll have to adjust your definitions a bit.
$endgroup$
Usually, in beginning number theory, we work only in the natural numbers (usually including $0$) so there are no negative numbers in this context. Assuming that, the definition of "divisor" would include the fact that a divisor is a natural number, than therefore positive. Then the definition:
A (natural) number $p$ greater than $1$ is prime iff it is divisible only by itself and $1$.
The "greater than $1$" part is important, because we don't want $1$ to be prime. (Although, historically it was considered a prime.) The implicit positiveness of the potential divisors is also important.
Later in the course, you can extend these definitions of "prime" and "divisor" to include the negative integers and then you'll have to adjust your definitions a bit.
answered 3 hours ago
B. GoddardB. Goddard
19.7k21442
19.7k21442
add a comment |
add a comment |
$begingroup$
Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Actually is worse. There would be no prime numbers as for any $x in mathbb R$ then $x = n*frac xn$ for any integer $n$ so $x$ has infinitely many divisors and can't be prime. $3$ is not prime because $frac 32, frac 34, frac 35$, etc all divide $3$. (The definition of $a$ divides $b$ is that there exists an integer $k$ so that $b = ka$. There is nothing in the definition that says $a$ and $b$ are integers)
So.......
The definition of "Having only $1$ and itself as divisor" assumes that we are only considering natural numbers (i.e. positive integers) and even then we are considering $1$ and "itself" to be different.
This definition is not even considering negative numbers to be considered. Nor is it considering that that rational non integers can be divisors.
Which is okay. We just have to be specific. The following would be a perfectly acceptable definition:
A natural number is prime if it has exactly two natural divisors; itself and $1$.
We can extend it extend this to all integers by saying a prime in any integer other than $pm 1$ with only two positive integer divisors; $1$ and the absolute value of itself. ... or a prime number is an integer which can not be expressed as a product of two or more non-unit ($pm 1$) integers.
With more abstract algebraic concepts we can define primes more precisely as Flowers' answer and various comment links explain. These also allow for primes in systems other than just the integers.
$endgroup$
add a comment |
$begingroup$
Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Actually is worse. There would be no prime numbers as for any $x in mathbb R$ then $x = n*frac xn$ for any integer $n$ so $x$ has infinitely many divisors and can't be prime. $3$ is not prime because $frac 32, frac 34, frac 35$, etc all divide $3$. (The definition of $a$ divides $b$ is that there exists an integer $k$ so that $b = ka$. There is nothing in the definition that says $a$ and $b$ are integers)
So.......
The definition of "Having only $1$ and itself as divisor" assumes that we are only considering natural numbers (i.e. positive integers) and even then we are considering $1$ and "itself" to be different.
This definition is not even considering negative numbers to be considered. Nor is it considering that that rational non integers can be divisors.
Which is okay. We just have to be specific. The following would be a perfectly acceptable definition:
A natural number is prime if it has exactly two natural divisors; itself and $1$.
We can extend it extend this to all integers by saying a prime in any integer other than $pm 1$ with only two positive integer divisors; $1$ and the absolute value of itself. ... or a prime number is an integer which can not be expressed as a product of two or more non-unit ($pm 1$) integers.
With more abstract algebraic concepts we can define primes more precisely as Flowers' answer and various comment links explain. These also allow for primes in systems other than just the integers.
$endgroup$
add a comment |
$begingroup$
Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Actually is worse. There would be no prime numbers as for any $x in mathbb R$ then $x = n*frac xn$ for any integer $n$ so $x$ has infinitely many divisors and can't be prime. $3$ is not prime because $frac 32, frac 34, frac 35$, etc all divide $3$. (The definition of $a$ divides $b$ is that there exists an integer $k$ so that $b = ka$. There is nothing in the definition that says $a$ and $b$ are integers)
So.......
The definition of "Having only $1$ and itself as divisor" assumes that we are only considering natural numbers (i.e. positive integers) and even then we are considering $1$ and "itself" to be different.
This definition is not even considering negative numbers to be considered. Nor is it considering that that rational non integers can be divisors.
Which is okay. We just have to be specific. The following would be a perfectly acceptable definition:
A natural number is prime if it has exactly two natural divisors; itself and $1$.
We can extend it extend this to all integers by saying a prime in any integer other than $pm 1$ with only two positive integer divisors; $1$ and the absolute value of itself. ... or a prime number is an integer which can not be expressed as a product of two or more non-unit ($pm 1$) integers.
With more abstract algebraic concepts we can define primes more precisely as Flowers' answer and various comment links explain. These also allow for primes in systems other than just the integers.
$endgroup$
Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Actually is worse. There would be no prime numbers as for any $x in mathbb R$ then $x = n*frac xn$ for any integer $n$ so $x$ has infinitely many divisors and can't be prime. $3$ is not prime because $frac 32, frac 34, frac 35$, etc all divide $3$. (The definition of $a$ divides $b$ is that there exists an integer $k$ so that $b = ka$. There is nothing in the definition that says $a$ and $b$ are integers)
So.......
The definition of "Having only $1$ and itself as divisor" assumes that we are only considering natural numbers (i.e. positive integers) and even then we are considering $1$ and "itself" to be different.
This definition is not even considering negative numbers to be considered. Nor is it considering that that rational non integers can be divisors.
Which is okay. We just have to be specific. The following would be a perfectly acceptable definition:
A natural number is prime if it has exactly two natural divisors; itself and $1$.
We can extend it extend this to all integers by saying a prime in any integer other than $pm 1$ with only two positive integer divisors; $1$ and the absolute value of itself. ... or a prime number is an integer which can not be expressed as a product of two or more non-unit ($pm 1$) integers.
With more abstract algebraic concepts we can define primes more precisely as Flowers' answer and various comment links explain. These also allow for primes in systems other than just the integers.
answered 2 hours ago
fleabloodfleablood
73.1k22789
73.1k22789
add a comment |
add a comment |
$begingroup$
Your definition is correct. The confusion is stemming is from the fact that fundamental results and definitions-- both in courses and in mathematics in general-- are often times stated without certain underlying hypotheses that are understood "automatically," whether for technically sound reasons or nothing better than "this is number theory so this is how we do it." I will address each of your statements.
"p is prime if it is divisible by only itself and 1."
This is the highly traditional definition of prime that is usually provided in number theory courses. This definition comes with an unstated condition that only positive divisors are considered. This is done to simplify and streamline many of the results in elementary number theory. (Notice in a similar vein how prime numbers are also usually only defined over the positive naturals. We never really hear about "negative primes," and we generally state that "2 is the only even prime," despite the fact that -2 also satisfies the same conditions.)
My understood definition of a prime number is a positive integer that has exactly 2 positive integer factors: 1 and itself.
Your definition is correct. In fact, your definition is actually more precise, and arguably "better," at least in the sense that it does not require the reader to "import" the assumption that only positive divisors are being considered in context.
Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Taken literally, yes, the first "traditional" definition of prime implies this statement, but of course as I said the traditional definition is importing the positive divisor assumption. So your statement is a humorous but untrue technicality-- we know -1 is not the only prime number. As I also mentioned earlier, we usually don't even allow primes to be negative.
New contributor
lagicol123015 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$
Your definition is correct. The confusion is stemming is from the fact that fundamental results and definitions-- both in courses and in mathematics in general-- are often times stated without certain underlying hypotheses that are understood "automatically," whether for technically sound reasons or nothing better than "this is number theory so this is how we do it." I will address each of your statements.
"p is prime if it is divisible by only itself and 1."
This is the highly traditional definition of prime that is usually provided in number theory courses. This definition comes with an unstated condition that only positive divisors are considered. This is done to simplify and streamline many of the results in elementary number theory. (Notice in a similar vein how prime numbers are also usually only defined over the positive naturals. We never really hear about "negative primes," and we generally state that "2 is the only even prime," despite the fact that -2 also satisfies the same conditions.)
My understood definition of a prime number is a positive integer that has exactly 2 positive integer factors: 1 and itself.
Your definition is correct. In fact, your definition is actually more precise, and arguably "better," at least in the sense that it does not require the reader to "import" the assumption that only positive divisors are being considered in context.
Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Taken literally, yes, the first "traditional" definition of prime implies this statement, but of course as I said the traditional definition is importing the positive divisor assumption. So your statement is a humorous but untrue technicality-- we know -1 is not the only prime number. As I also mentioned earlier, we usually don't even allow primes to be negative.
New contributor
lagicol123015 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$
Your definition is correct. The confusion is stemming is from the fact that fundamental results and definitions-- both in courses and in mathematics in general-- are often times stated without certain underlying hypotheses that are understood "automatically," whether for technically sound reasons or nothing better than "this is number theory so this is how we do it." I will address each of your statements.
"p is prime if it is divisible by only itself and 1."
This is the highly traditional definition of prime that is usually provided in number theory courses. This definition comes with an unstated condition that only positive divisors are considered. This is done to simplify and streamline many of the results in elementary number theory. (Notice in a similar vein how prime numbers are also usually only defined over the positive naturals. We never really hear about "negative primes," and we generally state that "2 is the only even prime," despite the fact that -2 also satisfies the same conditions.)
My understood definition of a prime number is a positive integer that has exactly 2 positive integer factors: 1 and itself.
Your definition is correct. In fact, your definition is actually more precise, and arguably "better," at least in the sense that it does not require the reader to "import" the assumption that only positive divisors are being considered in context.
Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Taken literally, yes, the first "traditional" definition of prime implies this statement, but of course as I said the traditional definition is importing the positive divisor assumption. So your statement is a humorous but untrue technicality-- we know -1 is not the only prime number. As I also mentioned earlier, we usually don't even allow primes to be negative.
New contributor
lagicol123015 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
Your definition is correct. The confusion is stemming is from the fact that fundamental results and definitions-- both in courses and in mathematics in general-- are often times stated without certain underlying hypotheses that are understood "automatically," whether for technically sound reasons or nothing better than "this is number theory so this is how we do it." I will address each of your statements.
"p is prime if it is divisible by only itself and 1."
This is the highly traditional definition of prime that is usually provided in number theory courses. This definition comes with an unstated condition that only positive divisors are considered. This is done to simplify and streamline many of the results in elementary number theory. (Notice in a similar vein how prime numbers are also usually only defined over the positive naturals. We never really hear about "negative primes," and we generally state that "2 is the only even prime," despite the fact that -2 also satisfies the same conditions.)
My understood definition of a prime number is a positive integer that has exactly 2 positive integer factors: 1 and itself.
Your definition is correct. In fact, your definition is actually more precise, and arguably "better," at least in the sense that it does not require the reader to "import" the assumption that only positive divisors are being considered in context.
Is the problem with the definition related to the fact that it doesn't specify sign, so then -1 would be the only "prime" number?
Taken literally, yes, the first "traditional" definition of prime implies this statement, but of course as I said the traditional definition is importing the positive divisor assumption. So your statement is a humorous but untrue technicality-- we know -1 is not the only prime number. As I also mentioned earlier, we usually don't even allow primes to be negative.
New contributor
lagicol123015 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
lagicol123015 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 34 mins ago
lagicol123015lagicol123015
1
1
New contributor
lagicol123015 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
lagicol123015 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
lagicol123015 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 |
$begingroup$
The precise way to define prime and irreducible elements in a commutative ring are given here and here. For the integers, the definitions are equivalent, so you can use either. Rephrasing the second link for integers:
A unit in a ring is an element that has a multiplicative inverse. In the integers, the only units are $1$ and $-1$. So a nonzero non-unit element of the integers is irreducible (prime) if it cannot be written as the product of two integers which are both non-units (not 1 or -1).
Note that this implies that negative primes exist. Unique factorization is defined up to multiplication by units.
$endgroup$
2
$begingroup$
Beware that the 2nd link only defines "irreducible" for integral domains. In more general rings there may be zero divisors, which forces common notions of "associate" to bifurcate into a few inequivalent notions. This variation percolates into related notions, e.g. "irreducib;e" - see this answer
$endgroup$
– Bill Dubuque
3 hours ago
add a comment |
$begingroup$
The precise way to define prime and irreducible elements in a commutative ring are given here and here. For the integers, the definitions are equivalent, so you can use either. Rephrasing the second link for integers:
A unit in a ring is an element that has a multiplicative inverse. In the integers, the only units are $1$ and $-1$. So a nonzero non-unit element of the integers is irreducible (prime) if it cannot be written as the product of two integers which are both non-units (not 1 or -1).
Note that this implies that negative primes exist. Unique factorization is defined up to multiplication by units.
$endgroup$
2
$begingroup$
Beware that the 2nd link only defines "irreducible" for integral domains. In more general rings there may be zero divisors, which forces common notions of "associate" to bifurcate into a few inequivalent notions. This variation percolates into related notions, e.g. "irreducib;e" - see this answer
$endgroup$
– Bill Dubuque
3 hours ago
add a comment |
$begingroup$
The precise way to define prime and irreducible elements in a commutative ring are given here and here. For the integers, the definitions are equivalent, so you can use either. Rephrasing the second link for integers:
A unit in a ring is an element that has a multiplicative inverse. In the integers, the only units are $1$ and $-1$. So a nonzero non-unit element of the integers is irreducible (prime) if it cannot be written as the product of two integers which are both non-units (not 1 or -1).
Note that this implies that negative primes exist. Unique factorization is defined up to multiplication by units.
$endgroup$
The precise way to define prime and irreducible elements in a commutative ring are given here and here. For the integers, the definitions are equivalent, so you can use either. Rephrasing the second link for integers:
A unit in a ring is an element that has a multiplicative inverse. In the integers, the only units are $1$ and $-1$. So a nonzero non-unit element of the integers is irreducible (prime) if it cannot be written as the product of two integers which are both non-units (not 1 or -1).
Note that this implies that negative primes exist. Unique factorization is defined up to multiplication by units.
edited 2 hours ago
answered 3 hours ago
FlowersFlowers
600410
600410
2
$begingroup$
Beware that the 2nd link only defines "irreducible" for integral domains. In more general rings there may be zero divisors, which forces common notions of "associate" to bifurcate into a few inequivalent notions. This variation percolates into related notions, e.g. "irreducib;e" - see this answer
$endgroup$
– Bill Dubuque
3 hours ago
add a comment |
2
$begingroup$
Beware that the 2nd link only defines "irreducible" for integral domains. In more general rings there may be zero divisors, which forces common notions of "associate" to bifurcate into a few inequivalent notions. This variation percolates into related notions, e.g. "irreducib;e" - see this answer
$endgroup$
– Bill Dubuque
3 hours ago
2
2
$begingroup$
Beware that the 2nd link only defines "irreducible" for integral domains. In more general rings there may be zero divisors, which forces common notions of "associate" to bifurcate into a few inequivalent notions. This variation percolates into related notions, e.g. "irreducib;e" - see this answer
$endgroup$
– Bill Dubuque
3 hours ago
$begingroup$
Beware that the 2nd link only defines "irreducible" for integral domains. In more general rings there may be zero divisors, which forces common notions of "associate" to bifurcate into a few inequivalent notions. This variation percolates into related notions, e.g. "irreducib;e" - see this answer
$endgroup$
– Bill Dubuque
3 hours ago
add a comment |
Peter is a new contributor. Be nice, and check out our Code of Conduct.
Peter is a new contributor. Be nice, and check out our Code of Conduct.
Peter is a new contributor. Be nice, and check out our Code of Conduct.
Peter is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3160805%2fwhy-does-the-statement-p-is-prime-if-it-is-divisible-by-only-itself-and-1-defi%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
1
$begingroup$
This related question may be helpful.
$endgroup$
– Brian
3 hours ago
2
$begingroup$
What do you mean “defines only one prime number”??
$endgroup$
– symplectomorphic
3 hours ago
1
$begingroup$
In my opinion your professor is wrong.
$endgroup$
– amsmath
3 hours ago
1
$begingroup$
That definition would be "wrong" because $1$ is divisible by $1$ and itself, but $1$ is not prime.
$endgroup$
– B.Swan
3 hours ago
2
$begingroup$
You should ask your professor what he or she meant. You are most likely interpreting what he or she said incorrectly.
$endgroup$
– symplectomorphic
3 hours ago