PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: Very high
ascending order (Definition)

A sequence or arbitrary ordered set or one-dimensional array of numbers, $ a$, is said to be in ascending order if each $ a_i \le a_{i + 1}$. For example, the Fibonacci sequence is in ascending order: 1, 1, 2, 3, 5, 8, 13, 21 ... The Perrin sequence is not in ascending order: 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17 ...

In a trivial sense, the sequence of values of the sign function is in ascending order: ... -1, -1, -1, 0, 1, 1, 1... When each $ a_i < a_{i + 1}$ in the sequence, set or array, then it can be said to be in strictly ascending order.



"ascending order" is owned by CompositeFan.
(view preamble)

View style:

See Also: descending order

Also defines:  strictly ascending order
Log in to rate this entry.
(view current ratings)

Cross-references: function, Perrin sequence, Fibonacci sequence, numbers, sequence
There are 11 references to this entry.

This is version 4 of ascending order, born on 2006-07-26, modified 2007-06-20.
Object id is 8176, canonical name is AscendingOrder.
Accessed 3706 times total.

Classification:
AMS MSC06A99 (Order, lattices, ordered algebraic structures :: Ordered sets :: Miscellaneous)

Pending Errata and Addenda
None.
[ View all 3 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)