-
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
proofs 4u (1 Viewer)
- Thread starter kractus
- Start date
Masaken
Unknown Member
someone posted this qn (18) a few days back i think:
boredofstudies.org
proofs make me want to jump off a cliff
Suppose that n =p^aq^b, where p and q are primes and p is not equal to q a) Use combinatorics (a counting argument) to explain why n has (a+1)(b + 1) factors. b) hence determine the number of factors of 80000.
boredofstudies.org
Would the following approach help with question 19?
If a - c is a divisor of ab + cd, there is an integer n such that)
(b-d))
n-(ad+bc))
ad + bc
n+(a-c)(d-b))
(n+d-b))
Therefore, a - c is a divisor of ad + bc.
If a - c is a divisor of ab + cd, there is an integer n such that
ad + bc
Therefore, a - c is a divisor of ad + bc.