I need a large number (at least 10s of millions of characters) algorithm for finding the products of multiplication of a given number for a given range of numbers. To better illustrate my need I have provided pseudo code describing the process needed as follows: BigInt=Very Large Integer (at least 10s of millions of characters) GetNumbers(BigInt BaseNumber, BigInt StartingRange, BigInt EndingRange) { Begin=Round(StartingRange / BaseNumber) CurrentNumber=(Begin-1)* StartingRange While (CurrentNumber<= EndingRange) { Add CurrentNumber to NumberList CurrentNumber= CurrentNumber + BaseNumber } return NumberList (delimited string) } example: (with small integers for clarity) “10,12,14,16,18,20??=GetNumbers(2, 10, 20) Speed is of the utmost important. I wish the mathematical functions to be programmed in assembly language, to take advantage of l2 cache and pipelining, and to be embedded in a C++ DLL for use by other languages (VB/C#). The assembly code should be optimized to take advantage of Intel’s Pentium 4 CPU. The application will be run in the windows environment.
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.
## Platform
Windows(NT/2000/XP)/Intel’s Pentium 4