Proof that q^2 is divisible by rm^2

Click For Summary

Homework Help Overview

The discussion revolves around a mathematical proof concerning the divisibility of \( q^2 \) by \( rm^2 \), with participants exploring the implications of certain assumptions and the structure of the problem.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants are attempting to clarify the problem setup and the assumptions regarding \( n \) and \( m \). There is a suggestion to analyze the prime factorization of \( n \) and to consider the implications of \( p^2 = rm^2q^2 \) on the divisibility of \( q^2 \).

Discussion Status

The discussion is active, with participants questioning the justification of certain assumptions and exploring different lines of reasoning. Some guidance has been offered regarding the structure of the proof and the relevance of prime factorization.

Contextual Notes

There are indications of missing information regarding the problem statement, as participants have requested clarification and details that are not fully provided in the thread.

courtrigrad
Messages
1,236
Reaction score
2
http://www.artofproblemsolving.com/Forum/weblog.php?w=564

Could someone help me with 2b?

Thanks
 
Physics news on Phys.org
the link for me says

"You do not have the permission to view this blog"

I guess you have to register to see it?

Can you type the problem here?
 
you should be able to see it now. changed the settings
 
I'm getting a page that says it's your blog, but it also says "total entries: 0" and there's not much tehre besides a calendar.

Is it that long of a problem that you couldn't just type it in here?
 
yeah, now it should work.
 
Last edited:
Alright. You get to p^2=n*q^2 and then assume that n=2*t? That's completely unjustified.

If n is not a perfect square then you can write it as n=r*m^2 where r has the property that if s is a prime and s divides r then s^2 does not divide r, r>1 obviously as well (you should prove this). Proceed from p^2=n*q^2 and see what happens.

You could also just look at the prime factorization of n if you have unique factorization at this point.
 
Ok, so [tex]p^{2} = rm^{2}q^{2}[/tex] and [tex]p^{2}[/tex] is divisible by [tex]rm^{2}[/tex]. So then I have to show that [tex]q^{2}[/tex] is also divisible by [tex]rm^{2}[/tex]. Is [tex]m[/tex] just any positive number?

Thanks
 
courtrigrad said:
Ok, so [tex]p^{2} = rm^{2}q^{2}[/tex] and [tex]p^{2}[/tex] is divisible by [tex]rm^{2}[/tex]. So then I have to show that [tex]q^{2}[/tex] is also divisible by [tex]rm^{2}[/tex]. Is [tex]m[/tex] just any positive number?

Thanks

It's probably easiest at this point to focus on some prime that divides r, say s. Then it will look very much like the usual proof sqrt(2) is irrational.

However we have a little snag. You are looking at p^2=r*(mq)^2 and you don't necessarily have mq and p relatively prime, but you should be able to fix this without much trouble.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
7
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 26 ·
Replies
26
Views
20K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 36 ·
2
Replies
36
Views
4K
  • · Replies 2 ·
Replies
2
Views
9K