sum stated

sum stated
index face amount

Burton's Legal Thesaurus. . 2006

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • sum certain — sum cer·tain / səm sərt ən/ n: an amount that can be determined with certainty from the information presented (as on a negotiable instrument) without resort to outside sources Merriam Webster’s Dictionary of Law. Merriam Webster. 1996. sum… …   Law dictionary

  • sum certain — ➔ certain * * * Ⅰ. sum certain ► LAW a particular amount of money stated in an agreement that cannot be changed: »The $10 million price is sum certain. Main Entry: ↑certain Ⅱ …   Financial and business terms

  • Sum 41 — live in concert at the West Palm Beach Warped Tour 2010 …   Wikipedia

  • sum certain — A requisite of a negotiable instrument is that it contains an unconditional promise to pay a sum certain. U.C.C. No. 3 104(lXb). In law of negotiable instruments, the sum payable is a sum certain even though it is to be paid (a) with stated… …   Black's law dictionary

  • stated — Determined, fixed, or settled @ stated meeting A meeting of a board of directors, board of officers, etc., held at the time appointed therefor by law, ordinance, by law, or other regulation; as distinguished from special meetings, which are held… …   Black's law dictionary

  • sum certain —    A specific amount that is stated in a contract or negotiable instrument (e.g., a promissory note) at the time the document is written and is not dependent on a future calculation or a future event. Engaging someone to do a task for a stated… …   Business law dictionary

  • capital sum — /kæpətl ˈsʌm/ (say kapuhtl sum) noun the sum stated to be payable on the happening of some event against which insurance has been effected …  

  • Kloosterman sum — In mathematics, a Kloosterman sum is a particular kind of exponential sum. Let a , b , m be natural numbers. Then :K(a,b;m)=sum {0leq xleq m 1, gcd(x,m)=1 } e^{2pi i (ax+bx^*)/m},Here x* is the inverse of x modulo m . They are named for the Dutch …   Wikipedia

  • Subset sum problem — In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set of integers, does the sum of some non empty subset equal exactly zero? For example, given the set { −7, −3 …   Wikipedia

  • Lack-of-fit sum of squares — In statistics, a sum of squares due to lack of fit, or more tersely a lack of fit sum of squares, is one of the components of a partition of the sum of squares in an analysis of variance, used in the numerator in an F test of the null hypothesis… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”