So I just completed my sophomore year as a CS major,
and I really want to work as some sort of analyst for a bank or investment company. I don't know what kind yet.
This summer I'm doing a program that will give me a general business minor, and I have the option of taking 2-3 more courses to turn it into a discipline specific minor.
The disciplines are:Accountancy, Business Law & Corporate Governance, Economics, Entrepreneurship, Finance, International Business, Management Information Systems, Marketing, or Real Estate.
Which would do you think would be more complimentary to my major?
How about in pursuing an analyst position?
He is known for his role in developing Zermelo–Fraenkel axiomatic set theory and his proof of the well-ordering theorem.
Name:
Anonymous2013-08-31 23:22
Exponentiation is given by
|X||Y| = |XY|
where XY is the set of all functions from Y to X.
Name:
Anonymous2013-09-01 0:07
One of Cantor's most important results was that the cardinality of the continuum \mathbf c is greater than that of the natural numbers {leph_0}; that is, there are more real numbers R than natural numbers N. Namely, Cantor showed that \mathbf{c} = 2^{leph_0} > {leph_0} (see Cantor's diagonal argument or Cantor's first uncountability proof).
Name:
Anonymous2013-09-01 0:52
Union of the sets A and B, denoted A ∪ B, is the set of all objects that are a member of A, or B, or both. The union of {1, 2, 3} and {2, 3, 4} is the set {1, 2, 3, 4} .
Name:
Anonymous2013-09-01 1:38
From set theory's inception, some mathematicians have objected to it as a foundation for mathematics. The most common objection to set theory, one Kronecker voiced in set theory's earliest years, starts from the constructivist view that mathematics is loosely related to computation. If this view is granted, then the treatment of infinite sets, both in naive and in axiomatic set theory, introduces into mathematics methods and objects that are not computable even in principle.
Name:
Anonymous2013-09-01 2:23
In the even simpler case of a collection of one set, a choice function just corresponds to an element, so this instance of the axiom of choice says that every nonempty set has an element; this holds trivially. The axiom of choice can be seen as asserting the generalization of this property, already evident for finite collections, to arbitrary collections
Name:
Anonymous2013-09-01 3:08
Zorn's lemma: Every non-empty partially ordered set in which every chain (i.e. totally ordered subset) has an upper bound contains at least one maximal element.