>A prime number is a positive integer p that has exactly two

>>8982331
It's actually because of this we haven't solved the Riemann hypothesis.

File: nomizi.jpg (108KB, 640x640px) Image search: [Google]

108KB, 640x640px

>>8982331
>Why don't we use this definition of prime numbers?
but that is the definition...?

>>8982331
Mathematicians like definitions that can be generalized to work for several algebraic structures.
Talking about numbers greater than 1 requires your ring to have some sort of order relation which only few rings have.

>Not defining prime numbers based on dubs
>A prime number is a positive integer p such that it isn't a 2-digit dubs number in any non trivial base (p-1) except 6

brainlets

>>8982342
The definition of a prime is that [math]p [/math] is a prime iff
[math]p [/math] divides [math]ab [/math] implies [math]p [/math] divides [math]a [/math] or [math]p [/math] divides [math]b [/math] for all [math]a [/math] and [math]b [/math].

File: Untitled.png (30KB, 825x311px) Image search: [Google]

30KB, 825x311px

>>8982351
I don't think you'll find many number theory texts using that definition, or at least I opened 3 random ones and none of them use that. Wikipedia doesn't either.

>>8982351
also this is wrong since it makes 1 a prime

>>8982331
>integer
>exactly two unique divisors: 1 and p
3
=1x3
=(-1)x(-3)
=(-1)x(-1)x1x3
=(-1)x(-1)x(-1)x(-3)

File: miyawide.png (548KB, 908x658px) Image search: [Google]

548KB, 908x658px

>>8982331
>I thought mathematicians liked beauty and all that.
"Two unique divisors" is ugly though.
If you want to see a beautiful definition, try this:

>A prime number is a positive integer p such that for any factorization of p into a product of finitely many positive integers [math]p = \prod_{i=1}^k n_i[/math] there is an i such that [math]p = n_i[/math].

This covers the case p=1 naturally, because there is a factorization of p that doesn't contain p itself as one of the factors: namely, the empty product (k=0).

As a bonus this definition of primality generalizes to any other type of mathematical structure for which a product is meaningful (which is just about everything).

File: 1491420168106.jpg (105KB, 425x476px) Image search: [Google]

105KB, 425x476px

>>8982418
>the empty product
>beautiful

>>8982351
lol no

>>8982351
This is the correct definition. OP's definition refers to irreducible numbers not primes.

The point is so that each number has a unique prime factorization

>>8982447
1 still isn't a prime number by that definition.

Definition 1:
A chocolate bar is a set of n rows and m collumn of squares of chocolate with n and m >1. (otherwise it's a chocolate stick)

Definition 2:
The set of prime numbers are all quantities of square of chocolate you can't obtain with a rectangular chocolate bar.

>>8982351
This is a more general definition for a general R, and p in R, where p is not a unit

prime always implies irreducible
in PID, like Z, the converse is also true

Did you guys know 7 is the only prime numbers that is a multiple of 7 ?

>>8982331
Because what you've defined there is an irreducible number, not a prime number. The two notions only happen to coincide in unique factorisation domains.

>>8982542
Did you guys know that n is the only prime number that is a multiple of n?

>>8982351
a = 4, b = 14
2 divides a, b and ab. Is 2 not a prime?

>>8982558
t. brainlet

>>8982560
I think it's you who are the brainlet.
>for all a and b

File: marteau.jpg (64KB, 772x501px) Image search: [Google]

64KB, 772x501px

>>8982566
>I think it's you who are the brainlet.

>2 divides ab=4*14 and 2 divides 4
>doesn't contradict 2 being prime
what's the issue exactly brainlet?

>>8982558
Yes, 2 factors out into (1 + i)(1 − i).

>>8982568
What issue brainlet? Prove 2 is a prime number.

>>8982558
1*1 = 1, so 2 is prime

>>8982572
fuck outta here

>>8982579
You've proven 2 is irreducible in Z. Prove it is prime.

>>8982583
Z is a euclidean domain so primes and irreducibles are equivalent. Q.E.D.

>>8982580
What's the matter, is i too much for u?

File: 1463407995488.jpg (21KB, 312x345px) Image search: [Google]

21KB, 312x345px

>>8982575
>Prove 2 is a prime number.
>look for divisors of 2 between 1 and 2
>there's no integers between 1 and 2
>therefore 2 is prime

next?

>>8982584
The proof for Z being euclidean assumes 2 is prime.

>>8982587
Congrats, you too have proven that 2 is an irreducible number. Now prove that it is prime.

>>8982590
https://proofwiki.org/wiki/Euclidean_Algorithm#Euclid.27s_Proof
No it doesn't. You lose.

File: are you serious.jpg (851KB, 1920x1200px) Image search: [Google]

851KB, 1920x1200px

>>8982591
see
>>8982363

next?

>>8982592
I meant the poof that in an euclidean domain the two are the same assumes that 2 is prime.
>>8982595
see
>>8982351

File: questionmar2.png (129KB, 314x278px) Image search: [Google]

129KB, 314x278px

>>8982599
but that definition is wrong, it even turns 1 into a prime

next?

>>8982601
That definition is incomplete. not wrong.
A prime is not a zero and not a unity such that whenever it divides a product ab it divides a or it divides b.

Prove 2 is prime.

File: 1491029299583.jpg (270KB, 1000x1000px) Image search: [Google]

270KB, 1000x1000px

>>8982609
assume 2 divides ab, so ab=2c for some c
if 2 divides a or b we're done, so assume otherwise

then a=2k+1 and b=2l+1 for some k,l

so 2c=ab=(2k+1)(2l+1)=4kl+2(k+l)+1
so 1= 2c-4kl-2(k+l)=2(c-kl-(k+l)), a contradiction

therefore 2 is prime

next?

>>8982614
Congratulations, you have proven that 2 is prime.
>next?
do it without appealing to the principle of the excluded middle.

>>8982618
don't hate on excluded middle

>>8982618
suppose 2 divides ab
in the ring Z/2Z we have (a+2Z)(b+2Z)=ab+2Z=2Z

Z/2Z has multiplication rule
(2Z)(2Z)=2Z
(2Z)(1+2Z)=2Z
(1+2Z)(1+2Z)=1+2Z

therefore one of a+2Z or b+2Z is 2Z
therefore 2 divides a or b

>>8982644
Congratulations, you have rewritten the proof in this post >>8982614
Now do it without appealing to the principle of the excluded middle.

>>8982587
>there's no integers between 1 and 2
Prove it buddy.

>>8982709
https://en.wikipedia.org/wiki/Peano_axioms

Prime numbers don't want to be divided into equal integers. The number 1 is a nigger for this reason.

File: 1491750904126.jpg (66KB, 1280x720px) Image search: [Google]

66KB, 1280x720px

>>8982338
>we haven't solved the Riemann hypothesis
Speak for yourself.

File: Tanaka_Smilesuka.png (360KB, 1920x1080px) Image search: [Google]

360KB, 1920x1080px

>>8982719
Lmao. I need to say this one in class. I bet all the students will be floored.

>>8982719
if
1 = 1
and
p > 1
or
1 < p
Then one is NOT prime

>>8982731
>he doesn't get it
BWAHAHAHAHAHA *breathes in* HAHAHAHAHA

>>8982675
can rational numbers be prime?

>>8982374
>Positive
Go back to middle school, you must be able to read in order to post here

File: monkfinger.jpg (216KB, 605x763px) Image search: [Google]

216KB, 605x763px

>>8982935
"two unique divisors" doesn't have the word positive in it

Go back to middle school, you must be able to read in order to post here

>>8982881
All elements in fields are units.

File: 1492725754752.gif (344KB, 462x500px) Image search: [Google]

344KB, 462x500px

>>8982952
>zero is a unit

>>8982954
All non-zero* elements in fields are units.

>>8982952
>>8982956
duh, you are correct sir. brainfart

File: 1481639075605.jpg (99KB, 500x354px) Image search: [Google]

99KB, 500x354px

>>8982942
Okay you double nigger. Two unique positive divisors.

File: double double.png (160KB, 606x504px) Image search: [Google]

160KB, 606x504px

>>8983313
No need for racism.

>>8982675
>do it without appealing to the principle of the excluded middle
Same proof but with binary products replaced by finite products, and using the definition in >>8982418.

>>8982609
To start, 2 is not a zero or a unity.

Suppose 2 divides ab.

If 2 divides a and b, we are done.

WLOG, suppose 2 does not divide a. We have 2c = ab and a = 2k + 1 for some integers c and k. Therefore
2c = 2bk + b
and
2(c - bk) = b.
It follows that 2 must divide b.

QED.

>>8982331
Both definitions are equivalent

>>8983502
Finally, another proper proof.

>>8982331
>I thought mathematicians liked beauty and all that.

They do. And "beauty" is precisely why they excluded 1 from being a prime number.

It all comes down to the unique prime factorization theorem:

"All positive numbers have a unique ordered prime factorization."

For example, 6 has only one unique ordered prime factorization: 2 * 3. (The "ordered" requirement prevents you from claiming that 3 * 2 is also a factorization, because the prime factors must always be listed in non-descending order.)

If you allowed 1 to be considered "prime", then the unique prime factorization theorem would be false. Example:

6 = 2 * 3
6 = 1 * 2 * 3
6 = 1 * 1 * 2 * 3
etc.

So in order to expose the beauty and elegance of the unique ordered prime factorization theorem, mathematicians had to exclude 1 from being prime.

(This is only one of many examples where 1 would muck up various formulas and theorems if it was allowed to be prime. Once you see a dozen cases of this, it becomes really clear that mathematicians did the right thing by excluding 1 from being prime.)

This also explains why negative integers are not considered prime. Example:

6 = 2 * 3
6 = -2 * -3

Since "negative primes" would also destroy the theorem, they are also excluded from being prime.

>>8984333
oops, I mean "positive integers", not "positive numbers" -- sorry.

>>8984333
Nobody said anything about considering 1 a prime. It still isn't a prime in OP's definition.