Show that any integer of form 4k+3 is divisible by a prime of same form.

4k+3 is odd; it has the same structure as 2k+1; or rather 2(2k) is even, and any even + an odd turns odd... but thats the answer to a different question aint it

3,6,9,... has a characteristic about it that i can vaguely recall

4(0) + 3 = 3, is prime; 4(1) + 3 = 7, is prime; 4(2)+3 = 11 is prime; ..15 is not prime;

On the right track....

15/3 is good; but are we saying it divisible by 1 prime of the same form? or by all primes of the same form?

a prime..

1 prime then ..

i havent come across an algorithm for primes to math against

im thinking i can rephrase the question like this: If\[m \equiv 3\]mod 4, then at least one prime that divides m must also be equivalent to 3 mod 4.

\[\frac{4k+3(factored?)}{4k+3}\]

Getting there...

if you use "\ ( \ )" remove spaces, you form inline latex \(\cfrac{top}{not.the.top}\) like this

Any integer is one of 4q,4q+1,4q+2 or 4q+3 (what Joe said).

Which has to be true, because using the Fundamental Theorem of Arithmetic to prime factor m gives: \[m \equiv 3 \iff p_1p_2p_3\ldots p_n \equiv 3\] Each p is going to be equivalent to either 0, 1, 2, or 3. None of them can be 0, otherwise m would be divisible by 4. If each p was only 1 and 2, then the product of primes would be divisible by some power of 2, which has no way of being congruent to 3 mod 4. If each p was just 1, when the product would be equivalent to 1. So there must be at least one prime equivalent to 3 mod 4.

4q and 4q+2 are even....

i thought we were only concerned with integers in the form 4q+3?

So any number of either of those forms is composite (excluding 2)

The way im doing the problem is a proof by contradiction. Im showing if m was in the form 4k+3, and none of its primes were in that form, then we get a contradiction. If m is in the form 4k+3, then m is equivalent to 3 mod 4. If none of its primes are equivalent to 3 mod 4, then there is no way the product of the primes can be equivalent to 3 mod 4.

So at least one prime has to be equivalent to 3 mod 4.

That's fine, what about the divisibility...

reading "the things they carried"-tom obrien; gotta talk about our feelings in phi101

i used the Fundamental Theorem of Arithmetic. Those primes have to divide m.

4k+3 is either prime or a a product of 2+ primes of form 4q+1 or 4q+3

alright, i can see that.

If u (4x+1)(4y+1) the answer is of form 4(z+1)

it will actually be in the form 4z+1 because: \[(4x+1)(4y+1) = 16xy+4x+4y+1 = 4(4xy+x+y)+1 = 4z+1\]

As an aside, this question is somewhat easier http://openstudy.com/groups/mathematics/updates/4e578a740b8b9ebaa896cfbd

So if, 4k+3 was divisible only by primes of type 4q+1 it would itself be form 4q+1

right right.

thats what i said above! in a roundabout way probably, my bad >.<

Just a question of dotting i's and crossing t's...

"If each p was just 1, when the product would be equivalent to 1" it was that statement.

I think u can easily manage the other one....

Actually, makes more sense to put it here Show that any prime greater than 3 must be of form 6k+1 or 6k+5

im a huge fan of "Proof by contradiction" For the other, i would show that if we had a prime in the form: \[6k+r, 0\leq r\leq 5\] that if r wasnt a 1 or a 5, you could factor our an integer, which shows it wasnt prime.

Like if r was 3, then the "prime" would be: \[6k+3 = 3(2k+1)\]this shows that the number 6k+3 is divisible by 3, and therefore isnt prime.

Yes, using the same principle as here 6q,6q+1...etc 3 are even and 1 is divisible by 3...

i cant wait for stuff like this in my class. its very interesting lol

thank you for stopping me from doing my homework <.< lololol. its not due till monday anywhos.

It's hard to get ur head around it being all in integers when u are used to dealing with real numbers,lol

Sorry...:-)

I will put up 1 or 2 more , maybe....

i should leave! otherwise i'll be late for class because im on here lol

heheh

class starts at 9:30 :)

Join our real-time social learning platform and learn together with your friends!