Recent content by rdr3
-
R
Intro to Proofs: Greatest Common Divisors
So maybe this? Suppose d[SIZE="4"]∤c... Then c≠nd In which case, c≠nd≠(nx0)a+(ny0)b. So like that? Or am I way off? Sorry I'm not very good at this... The teacher explains things way over everyone's head.- rdr3
- Post #3
- Forum: Calculus and Beyond Homework Help
-
R
Intro to Proofs: Greatest Common Divisors
Homework Statement (a) Let a and b be integers with gcd(a,b)=d, and assume that ma+nb=d for integers m and n. Show that the solutions in Z to xa+yb=d are exactly x=m+k(b/d), y=n-k(a/d) where k∈Z. (b) Let a and b be integers with gcd(a,b)=d. Show that the equation xa+yb=c...- rdr3
- Thread
- Intro Proofs
- Replies: 2
- Forum: Calculus and Beyond Homework Help
-
R
Introduction to Proofs: One-to-One and Onto Problem
1. Given: Let f: X → Y be a function. Then we have an associated function f-1: P(Y) → P(X), where f-1 (B)⊂X is the inverse image of B⊂Y. Question: Show that f^(-1) is one-to-one if and only if f is onto. [Notes: ⊂ represents subspace, I just couldn’t find a way to put the line under the...- rdr3
- Thread
- Introduction Proofs
- Replies: 1
- Forum: Calculus and Beyond Homework Help