|
|||||||||
|
|||||||||
| |||||||||
|
|||||||||
|
|||||||||
| |||||||||
|
|
|
| |||||||||
 |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Rate Thread | Display Modes |
Dev Shed Forums Sponsor:
|
|
Get inside! Sample the range of functionality easily built with JMSL Library for Time Series Data Analysis, Heat Maps, Portfolio Optimization, Monte Carlo Simulation, Stock Price Charting and more. Download Now! |
|
#1
May 4th, 2007, 10:12 AM
|
|||
|
|||
|
Assembly prob
I want to make a program that verifies if a number is a perfect cube. It's for the 8086 processor and i'm implementing it using turbo assembler. Could you give me some guidelines ?
Thanks
|
|
#2
May 5th, 2007, 04:18 AM
|
|||
|
|||
|
I presume by perfect cube you mean numbers such as 1, 8, 27 and so on, n3 = n x n x n ?
If so you may find it useful to look at some more basic maths functions, googling this turned up many results. When trying to work with mathmatically special numbers you need to know the underlying principles of how they are worked out and alternative methods. This usually provides some help of how you would go about doing this using ADD, SUB, and so on. If you can't find much about roots and cube roots take a look at powers and indexes/indices as the cube root of n is the same as n to the power of a third. Hope this is of help 
__________________
Did this post help? Please Click The  Next To My PostNeed help? Did you try Google? Take a look over at my current work in progress http://crispycrisp.org
|
|
| Viewing: Dev Shed Forums > Programming Languages - More > Other Programming Languages > Assembly prob |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
 |
|
|
Del.icio.us
Digg
Google
Spurl
Blink
Furl
Simpy
Y! MyWeb
Linear Mode
