It looks like you're new here. If you want to get involved, click one of these buttons!

- 140.8K All Categories
- 103.6K Programming Languages
- 6.4K Assembler Developer
- 401 Assembly Code Share
- 239 Getting started in assembly
- 4.6K x86 Assembly
- 1.9K Basic
- 97 Qbasic
- 39.9K C and C++
- 5.6K Beginner C/C++
- 330 C/C++ on Linux/Unix
- 450 C/C++ Windows API
- 522 C++ Builder
- 253 C++ Game Development
- 3.3K C++ MFC
- 103 C++.NET
- 404 Visual C++
- 2.9K C#
- 7.9K Delphi and Kylix
- 334 Advanced Delphi
- 360 Delphi beginners
- 4 Haskell
- 9.7K Java
- 56 Enterprise JavaBeans
- 1.3K Java Beginners
- 304 Java Server Pages
- 4.1K Pascal
- 1.3K Perl
- 11 Perl 6
- 2K PHP
- 546 Python
- 37 Ruby
- 4.4K VB.NET
- 258 Advanced VB.Net
- 1.6K VBA
- 20.8K Visual Basic
- 767 Access databases and VB
- 831 Advance Visual Basic
- 1.2K Beginner VB
- 2.6K Game programming
- 315 Console programming
- 90 DirectX Game dev
- 1 Minecraft
- 112 Newbie Game Programmers
- 2 Oculus Rift
- 9K Applications
- 1.8K Computer Graphics
- 279 3D Graphics
- 129 DirectX
- 125 OpenGL
- 740 Computer Hardware
- 9 Cooling & Overclocking
- 3.4K Database & SQL
- 1.1K Access
- 91 ADO Programming
- 288 MySQL
- 358 Oracle
- 440 SQL-Server
- 535 Electronics development
- 1.6K Matlab
- 628 Sound & Music
- 25 DirectSound
- 257 XML Development
- 3.3K Classifieds
- 199 Co-operative Projects
- 198 For sale
- 190 FreeLance Software City
- 1.9K Jobs Available
- 603 Jobs Wanted
- 209 Wanted
- 2.9K Microsoft .NET
- 1.8K ASP.NET
- 1.1K .NET General
- 22 .NET WEB-Services
- 129 .NET WinForms
- 14 .NET XML
- 50 ADO.NET
- 142 C# & VB.NET School Support
- 3.4K Miscellaneous
- 4 Join the Team
- 354 Comments on this site
- 69 Computer Emulators
- 2.1K General programming
- 187 New programming languages
- 621 Off topic board
- 200 Mobile & Wireless
- 72 Android
- 126 Palm Pilot
- 338 Multimedia
- 154 Demo programming
- 184 MP3 programming
- 0 Bash scripts
- 27 Cloud Computing
- 1 Witsbits Go Cloud
- 53 FreeBSD
- 1.7K LINUX programming
- 1 Awk scripting
- 332 Linux Support
- 0 Sed scripting
- 370 MS-DOS
- 0 Shell scripting
- 321 Windows CE & Pocket PC
- 4.1K Windows programming
- 177 COM/DCOM
- 61 Networking And Security
- 17 Windows 2003 Server
- 6 Windows Vista
- 176 Windows XP
- 939 Software Development
- 416 Algorithms
- 68 Object Orientation
- 24 RUP & UML
- 91 Project Management
- 95 Quality & Testing
- 268 Security
- 63 Evil Scripting
- 81 Hacking
- 7.7K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 4 Bootstrap Themes
- 55 CGI Development
- 28 ColdFusion
- 224 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 131 Mobile Internet & Messaging
- 211 Wireless development
- 2.2K JavaScript
- 37 JQuery
- 304 WEB Servers
- 153 Apache
- 79 IIS
- 150 WEB-Services / SOAP

## Comments

:

What is lcm and gcd ?

: :

: What is lcm and gcd ?

:

Least Common Multiple - Smallest number that all given numbers can be evenly multiplied into. 2, 3 and 4 = 12 (2*6, 3*4 and 4*3).

Greatest Common Denominator - Largest number that can be evenly divided into all the given numbers. 6, 12 and 15 = 3 (3*2, 3*4 and 3*5).

I could come up with something, but it'd probably be the slowest code anyone has ever seen.

: : : I wrote a program a little while ago that can calculate lcm and gcd of natural numbers. But its slow, to calculate the lcm of 123 345 567, it took 33 seconds. Anybody who can write a code which can perform faster. Thanx in advance.

: : :

: : What is lcm and gcd ?

: :

:

: Least Common Multiple - Smallest number that all given numbers can be evenly multiplied into. 2, 3 and 4 = 12 (2*6, 3*4 and 4*3).

:

: Greatest Common Denominator - Largest number that can be evenly divided into all the given numbers. 6, 12 and 15 = 3 (3*2, 3*4 and 3*5).

:

: I could come up with something, but it'd probably be the slowest code anyone has ever seen.

:

Ohhh, sorry, I hate that kind of problems, anyways why do you need it ?

PS. You could give your code, maybe there are some opimalizations to do

: : : : I wrote a program a little while ago that can calculate lcm and gcd of natural numbers. But its slow, to calculate the lcm of 123 345 567, it took 33 seconds. Anybody who can write a code which can perform faster. Thanx in advance.

: : : :

: : : What is lcm and gcd ?

: : :

: :

: : Least Common Multiple - Smallest number that all given numbers can be evenly multiplied into. 2, 3 and 4 = 12 (2*6, 3*4 and 4*3).

: :

: : Greatest Common Denominator - Largest number that can be evenly divided into all the given numbers. 6, 12 and 15 = 3 (3*2, 3*4 and 3*5).

: :

: : I could come up with something, but it'd probably be the slowest code anyone has ever seen.

: :

:

: Ohhh, sorry, I hate that kind of problems, anyways why do you need it ?

:

: PS. You could give your code, maybe there are some opimalizations to do

:

I am making a program in which I have a compilation of such stuffs, like Mean finder, Base convertor, Prime number detector, Root finder, Exponent finder etc. I am sorry, I can't give you the code. Because, if I do so, my friend would kill me, as he thinks that CODES are more precious than DIAMONDS.

: : : : : I wrote a program a little while ago that can calculate lcm and gcd of natural numbers. But its slow, to calculate the lcm of 123 345 567, it took 33 seconds. Anybody who can write a code which can perform faster. Thanx in advance.

: : : : :

: : : : What is lcm and gcd ?

: : : :

: : :

: : : Least Common Multiple - Smallest number that all given numbers can be evenly multiplied into. 2, 3 and 4 = 12 (2*6, 3*4 and 4*3).

: : :

: : : Greatest Common Denominator - Largest number that can be evenly divided into all the given numbers. 6, 12 and 15 = 3 (3*2, 3*4 and 3*5).

: : :

: : : I could come up with something, but it'd probably be the slowest code anyone has ever seen.

: : :

: :

: : Ohhh, sorry, I hate that kind of problems, anyways why do you need it ?

: :

: : PS. You could give your code, maybe there are some opimalizations to do

: :

:

: I am making a program in which I have a compilation of such stuffs, like Mean finder, Base convertor, Prime number detector, Root finder, Exponent finder etc. I am sorry, I can't give you the code. Because, if I do so, my friend would kill me, as he thinks that CODES are more precious than DIAMONDS.

:

:

But we are supposed to give up code??? Not a convincing arguement...

: : : : : I wrote a program a little while ago that can calculate lcm and gcd of natural numbers. But its slow, to calculate the lcm of 123 345 567, it took 33 seconds. Anybody who can write a code which can perform faster. Thanx in advance.

: : : : :

: : : : What is lcm and gcd ?

: : : :

: : :

: : : Least Common Multiple - Smallest number that all given numbers can be evenly multiplied into. 2, 3 and 4 = 12 (2*6, 3*4 and 4*3).

: : :

: : : Greatest Common Denominator - Largest number that can be evenly divided into all the given numbers. 6, 12 and 15 = 3 (3*2, 3*4 and 3*5).

: : :

: : : I could come up with something, but it'd probably be the slowest code anyone has ever seen.

: : :

: :

: : Ohhh, sorry, I hate that kind of problems, anyways why do you need it ?

: :

: : PS. You could give your code, maybe there are some opimalizations to do

: :

:

: I am making a program in which I have a compilation of such stuffs, like Mean finder, Base convertor, Prime number detector, Root finder, Exponent finder etc. I am sorry, I can't give you the code. Because, if I do so, my friend would kill me, as he thinks that CODES are more precious than DIAMONDS.

:

: Okay, here is the so called CODE:

'start

PRINT " Please make the following entries..."

entryforlcm:

INPUT "Enter no of digits: ", max

max = FIX(max)

IF max < 0 OR max = 0 THEN COLOR 12: PRINT "!!Invalid Value!!": COLOR 15: GOTO entryforlcm

REDIM numbers(max)

FOR deb = 1 TO max

PRINT " Digit "; : INPUT numbers(deb)

NEXT deb

COLOR 9: PRINT " Press 'Esc' to abort calculation": COLOR 15

COLOR 7: PRINT "The LCM for "; : COLOR 15

FOR I = 1 TO max

PRINT numbers(I);

NEXT I

COLOR 7: PRINT " is"; : COLOR 15

t1 = TIMER

FindLCM numbers(), max, x

t2 = TIMER

PRINT x

'here is the finlcm sub

SUB FindLCM (numbers(), max, x)

x = numbers(1): I = 1

DO

progress = progress + 1

IF INT(x / numbers(I)) = x / numbers(I) THEN

IF I = max THEN

EXIT DO

ELSE

I = I + 1

IF I = max + 1 THEN I = max

END IF

ELSE

x = x + 1: I = 1

END IF

press = INP(&H60)

IF press = 1 THEN COLOR 12: PRINT " !!Calculation Aborted!!": COLOR 15: EXIT DO

LOOP

END SUB

DEFLNG A-Z

COLOR 9: PRINT "a program to calculate the LOWEST COMMON MULTIPLE of a set of integers"

ON ERROR GOTO handler

COLOR 7: INPUT "How many integers? ", n

: x = 1: FOR n = 1 TO n

: a = x: INPUT "Int: ", b: IF a < b THEN SWAP a, b

: x = a: WHILE x mod b: x = x + a: WEND: NEXT

COLOR 5: PRINT "LCM:"; x: END

handler: PRINT "Result too large": END