Finished your HSC? Check out our University Discussion, Non-School forums or help out next year's HSC students!
YOU can help the next generation of students in the community! Share your trial papers and notes on our Notes & Resources page

proof by contradiction q (1 Viewer)

Thread starter fx82au
Start date Jan 14, 2023

F

fx82au

Active Member

#1

how do i got about proving?
my assumption is: $p_1 and p_2 >= \sqrt n$

thanks

N

nathanzhou1234

Active Member

#2

fx82au said:
View attachment 37435
how do i got about proving?
my assumption is: $p_1 and p_2 >= \sqrt n$

thanks

If they’re both greater, then n will equal both of them (p1 and p2) multiplied together which will be bigger than n, a contradiction

F

fx82au

Active Member

#3

nathanzhou1234 said:
If they’re both greater, then n will equal both of them (p1 and p2) multiplied together which will be bigger than n, a contradiction

thanks! but what if theyre both equal?

N

nathanzhou1234

Active Member

#4

fx82au said:
thanks! but what if theyre both equal?

I think the question should say that p1 and p2 are distinct otherwise it doesn't make sense

You must log in or register to reply here.

Share:

Facebook Twitter Reddit Pinterest Tumblr WhatsApp Email Link

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top