<< Prev Showing: 96-100 of 187 Next >>
· 71-75 · 76-80 · 81-85 · 86-90 · 91-95 · 96-100 · 101-105 · 106-110 · 111-115 · 116-120 · 121-125 ·Need help in determining the following proof. (See attached file for full problem description) --- Thm 11.1.2 (the pigeonhole principle): Suppose that f:X Y is a function between non-empty finite sets such that |X| > |Y|. Then f is not an injection, i.e. there exist distinct elements x1 and x2 E (epsilon) X such that f(x1) = f(x2). ---
Subject:
Math
Topic:
Theory of Numbers
Posting ID:
54872
OTA ID:
101298
Need help in determining the following proof exercises. Please use general logic notation such as U. (See attached file for full problem description) --- Proposition 10.2.1: (the addition principle) Suppose that X and Y are disjoint finite sets. Then X U Y is finite and |X UY| = |X| + |Y|. Corollary 10.2.2: For a positive integer n, suppose that X1, X2….,Xn is a collection of n pairwise disjoint finite sets (i.e. i does not = j => Xi Xj = empty set) Then X1 U X2 U….U Xn = U ( lim from n to i=1) Xi is a finite set and |X1 U X2 U……U Xn| = |X1| + |X2|+….|Xn|. ---
Subject:
Math
Topic:
Theory of Numbers
Posting ID:
54927
OTA ID:
101298
Number Theory. 400 level. Introductory Course in Undergraduate.
Topics usually include the Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitive roots, quadratic reciprocity and quadratic fields. (See attached file for full problem description)
Subject:
Math
Topic:
Theory of Numbers
Posting ID:
55290
OTA ID:
103997
Number Theory. 400 level. Introductory Course in Undergraduate.
Topics usually include the Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitive roots, quadratic reciprocity and quadratic fields. (See attached file for full problem description)
Subject:
Math
Topic:
Theory of Numbers
Posting ID:
55291
OTA ID:
101298
Number Theory. 400 level. Introductory Course in Undergraduate.
Topics usually include the Euclidean algorithm, primes and unique factorization, congruences, Chinese Remainder Theorem, Hensel's Lemma, Diophantine equations, arithmetic in polynomial rings, primitive roots, quadratic reciprocity and quadratic fields. (See attached file for full problem description)
Subject:
Math
Topic:
Theory of Numbers
Posting ID:
55294
OTA ID:
101298
<< Prev Showing: 96-100 of 187 Next >>
· 1-5 · 6-10 · 11-15 · 16-20 · 21-25 · 26-30 · 31-35 · 36-40 · 41-45 · 46-50 · 51-55 · 56-60 · 61-65 · 66-70 · 71-75 · 76-80 · 81-85 · 86-90 · 91-95 · 96-100 · 101-105 · 106-110 · 111-115 · 116-120 · 121-125 · 126-130 · 131-135 · 136-140 · 141-145 · 146-150 · 151-155 · 156-160 · 161-165 · 166-170 · 171-175 · 176-180 · 181-185 · 186-187 ·Page generated in 0.0158 seconds