Project 1999

Go Back   Project 1999 > General Community > Off Topic

Closed Thread
 
Thread Tools Display Modes
  #1  
Old 07-16-2018, 02:00 PM
maskedmelonpai maskedmelonpai is offline
Fire Giant

maskedmelonpai's Avatar

Join Date: Aug 2016
Location: Left hand of the Master
Posts: 695
Default Did you know?

LCM(x,y) == (x * y)/HCF(x,y)


i SRSly just learned this recently and feel dumb (but less so) now.
  #2  
Old 07-16-2018, 02:14 PM
LulzSect© LulzSect© is offline
Banned


Join Date: Jun 2018
Location: New York
Posts: 653
Default

im bad at maths too bud

pats melons softly
  #3  
Old 07-16-2018, 02:21 PM
maskedmelonpai maskedmelonpai is offline
Fire Giant

maskedmelonpai's Avatar

Join Date: Aug 2016
Location: Left hand of the Master
Posts: 695
Smile

*smiles brightly*

ty lulz and it's okay, dino, it only conditionally useful information.
  #4  
Old 07-16-2018, 02:33 PM
Cecily Cecily is offline
Planar Protector

Cecily's Avatar

Join Date: Jan 2012
Posts: 5,465
Default

Alright now prove you understand it and teach us to do it. I miss trying to teach people A&P.
  #5  
Old 07-16-2018, 04:07 PM
maskedmelonpai maskedmelonpai is offline
Fire Giant

maskedmelonpai's Avatar

Join Date: Aug 2016
Location: Left hand of the Master
Posts: 695
Cool

well, okay, butt i ain't actually written any proofs yet, so this will be my first time (o^^o)

Proposition: The Lease Common Multiple of a coupla numbers x & y, is they product divided by they Highess Common Factor, that is:

(x,y)Ǝlcm.lcm = (x *y)/hcf(x,y)

1. both numbers x & y are liek the product of a buncha smaller ones that're called
"primes." that to say: [i]for every number (n), there exist a set (s) of smaller numbers, whomsts product (p) = (x). another words:

nƎs.P(s) = n

i think this pretty obvious and not really sure how or why to prove it ATM, so just gonna say it a lemma an move on.

2. The LCM of a coupla numbers is the littlest number that both the numbers can fit into evenly if you made a buncha copies of each. to find the LCM of a pair, we take an get ridda all the overlapping factors between them, such that there are enough prime factors left over that we can still make each number, but that's it. THEN we multiply all those factors together.

3. The hcf of two numbers is the sum of all the overlapping prime factors between the two numbers. That is to say that for every set (p) of prime factors of a product, there exist a set (o) of overlapping prime factors between the two multiples that the product come from. another words:

pƎo. HCF(x,y) = f(o) where f is product of o


An then we try it out:



Let x = 6, y = 4;
F(x) = 2,3
F(y) = 2,3
LCM(x,y) = 2*2*3 = 12 *cause we need two 2s to make a four and one 2 and a 3 to make a six.
HCF(x,y) = 2

LCM(x,y) = (x * y)/HCF(x,y)
=(6*4)/2
=24/2
=12

BOOM! [You must be logged in to view images. Log in or Register.]
  #6  
Old 07-16-2018, 04:27 PM
LulzSect© LulzSect© is offline
Banned


Join Date: Jun 2018
Location: New York
Posts: 653
Red face

[You must be logged in to view images. Log in or Register.]
  #7  
Old 09-05-2018, 11:29 AM
stacijenkins stacijenkins is offline
Decaying Skeleton


Join Date: Sep 2018
Posts: 1
Default

woowww....It's so hard for me( I'm bad in math( Although now I'm studying with a programmer and working on a graduation project on riverbelle casino mobile website and app. And It's really interesting for me
Closed Thread

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off

Forum Jump


All times are GMT -4. The time now is 04:58 AM.


Everquest is a registered trademark of Daybreak Game Company LLC.
Project 1999 is not associated or affiliated in any way with Daybreak Game Company LLC.
Powered by vBulletin®
Copyright ©2000 - 2024, Jelsoft Enterprises Ltd.