factoring |
english |
Difino
| • | In math, see Factorization. In business and finance, factoring is the sale of accounts receivable. It is an alternative to lending with ancient origins. Many hybrid forms of factoring exist, but in its most basic form it involves three parties: Seller, Buyer, and Account Debtor. The Seller is the concern that has produced goods or delivered services to their customer (the Account Debtor). The Buyer (the factor or factoring company) buys rights to collect the Seller's accounts receivable, which are due from the Account Debtor at some point in the future, and receives a discount fee. In return for ceding collection rights, the Seller receives a discounted payment at the time of factoring and can use those funds for operations, growth, etc. In factoring, the most important risk assessment is in determining the creditworthiness of the Account Debtor, not the Seller. Thus, factoring can be offered to companies without strong credit or companies that do not meet traditional bank lending requirements. It is also useful for seasonal businesses, international transactions, and any situation where non-debt financing is preferred. Source: [wikipedia: factoring] |
number_theory:math
| Factoring Fermat Numbers | ||
| cash prizes for new factors of fermat numbers fn, for n = 12 through 22. | ||
| Factoring Papers | ||
| links to papers on the theory and practice of factoring. | ||
| FactorWorld | ||
| dedicated to algorithms and computational results on integer factorization. includes links to papers, downloadable software, and online resources. | ||
| Known Amicable Pairs | ||
| a listing of all the known pairs of numbers, each of which is the sum of the aliquot divisors of the other. complete for smaller numbers, and extending beyond 200 digits. | ||
| Robinson Primes | ||
| an analysis of problems relating to the numbers k.2^n+-1, primes, and factor patterns, including the sierpinski problem. | ||
| Sierpinski Problem | ||
| sierpinski proved there exist infinitely many odd integers k such that k*2^n+1 is composite for every n. ray ballinger coordinates a search to prove or disprove whether k=78557 is the smallest solution. | ||
| The XYYXF Project | ||
| a collaborative project to produce the factorizations of x^y + y^x for 1<y<x<101. | ||
alebrije.info : alebrijes : sites : advertising : link to us : contact
• Fuzzy search
factor v leiden
factorial and binomial topics
factories and workshops fields
perfect numbers
software
• Specialized stores
Amazon.com (US)
Amazon.ca (CA)
Amazon.co.uk (UK)
• Specialized search
Discovery.com
Exploratorium
TutorialFind
• General crawlers
All the Web
AltaVista
Google
Lycos
Mamma
Msn
Overture
Teoma
WiseNut