Busy. Please wait.
or

show password
Forgot Password?

Don't have an account?  Sign up 
or

Username is available taken
show password

why

Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account.

By signing up, I agree to StudyStack's Terms of Service and Privacy Policy.


Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.

Remove ads
Don't know
Know
remaining cards
Save
0:01
To flip the current card, click it or press the Spacebar key.  To move the current card to one of the three colored boxes, click on the box.  You may also press the UP ARROW key to move the card to the "Know" box, the DOWN ARROW key to move the card to the "Don't know" box, or the RIGHT ARROW key to move the card to the Remaining box.  You may also click on the card displayed in any of the three boxes to bring that card back to the center.

Pass complete!

"Know" box contains:
Time elapsed:
Retries:
restart all cards




share
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

Calc 1

Vocab List 1-11

QuestionAnswer
Commutative For every x,y belonging to F, there is a x+y=y+x and a x*y=y*x
Associative For every x,y,z belonging to F there is: (x+y)+z=x+(y+z) and (x*y)*z=x*(y*z)
Closure For every x,y belonging to F there is x+y belonging to F and x*y belonging to F.
Well-Ordering Principle -Every non-empty sub set of Natural Numbers has a least element. -If M <= Natural Numbers, then there exists R belonging to M so that R <=a for ever a belonging to M.
Induction Principle (Natural Numbers) Suppose P(n) is a statement about: n belonging to Natural Numbers, If we can show 1.P(1) is true. 2.Whenever P(n) is true then P(n+1) is true. Then P(n) is true for all n.
Ordered Field A field F that is an ordered set with the following additional properties: 1. If x>0 and y>0 then x+y>0 2. If x>0 and y>0 then x*y>0 3. x<y if and only if y-x>0
Order An order on a set S is a relation that satisfies the following: 1. If x,y belongs to S, then exactly one of x<y, x=y, or y<x is true. 2. For all x,y,z belonging to S, if x<y and y<z then x<z.
Field A nonempty set F of objects that has two operations, addition and multiplication, that satisfy the following properties: -Closure -Associative -Identity -Inverses -Distributive -Commutative
Distributive For every x,y,z belonging to F there is x*(y+z)= x*y + x*z
Inverses For every x belonging to F there is -x belonging to F so that x+(-x)=0 For each x belonging to F there is a 1/x belonging to F so that x* (1/x) = 1, x!=0.
Identity For x belonging to F there exists 0 belonging to F so that x+0=x and there exists 1 belonging to F so that x*1=x.
Created by: rissa230