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

- 140.6K All Categories
- 104.4K Programming Languages
- 6.4K Assembler Developer
- 1.8K Basic
- 39.7K C and C++
- 4.2K C#
- 7.9K Delphi and Kylix
- 4 Haskell
- 9.6K Java
- 4.1K Pascal
- 1.3K Perl
- 1.9K PHP
- 505 Python
- 48 Ruby
- 4.3K VB.NET
- 1.6K VBA
- 20.8K Visual Basic
- 2.6K Game programming
- 309 Console programming
- 88 DirectX Game dev
- 1 Minecraft
- 108 Newbie Game Programmers
- 2 Oculus Rift
- 8.9K Applications
- 1.8K Computer Graphics
- 726 Computer Hardware
- 3.4K Database & SQL
- 520 Electronics development
- 1.6K Matlab
- 627 Sound & Music
- 254 XML Development
- 3.3K Classifieds
- 189 Co-operative Projects
- 178 For sale
- 189 FreeLance Software City
- 1.9K Jobs Available
- 599 Jobs Wanted
- 201 Wanted
- 2.9K Microsoft .NET
- 1.7K ASP.NET
- 1.1K .NET General
- 2.9K Miscellaneous
- 3 Join the Team
- 2 User Profiles
- 353 Comments on this site
- 59 Computer Emulators
- 1.8K General programming
- 147 New programming languages
- 597 Off topic board
- 163 Mobile & Wireless
- 37 Android
- 124 Palm Pilot
- 335 Multimedia
- 151 Demo programming
- 184 MP3 programming
- 0 Bash scripts
- 15 Cloud Computing
- 52 FreeBSD
- 1.7K LINUX programming
- 366 MS-DOS
- 0 Shell scripting
- 319 Windows CE & Pocket PC
- 4.1K Windows programming
- 884 Software Development
- 403 Algorithms
- 67 Object Orientation
- 85 Project Management
- 88 Quality & Testing
- 233 Security
- 7.5K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 2 Bootstrap Themes
- 55 CGI Development
- 19 ColdFusion
- 222 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 33 JQuery
- 285 WEB Servers
- 111 WEB-Services / SOAP

Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

About & Contact / Terms of use / Privacy statement / Publisher: Lars Hagelin

Programmers Heaven articles / Programmers Heaven files / Programmers Heaven uploaded content / Programmers Heaven C Sharp ebook / Operated by CommunityHeaven LLC

© 1997-2013 Programmersheaven.com - All rights reserved.

## Comments

595Member:

What is lcm and gcd ?

- Spam

0 · Vote Down Vote Up · Share on Facebook3,948Member: :

: 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.

- Spam

0 · Vote Down Vote Up · Share on Facebook595Member: : : 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

- Spam

0 · Vote Down Vote Up · Share on Facebook16Member ✭: : : : 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.

- Spam

0 · Vote Down Vote Up · Share on Facebook3,948Member: : : : : 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...

- Spam

0 · Vote Down Vote Up · Share on Facebook16Member ✭: : : : : 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

- Spam

0 · Vote Down Vote Up · Share on Facebook13MemberDEFLNG 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

- Spam

0 · Vote Down Vote Up · Share on Facebook