LCM Proof: Check My Work and Find Errors | Easy Method

  • Thread starter Fisicks
  • Start date
  • Tags
    Proof
In summary, the speaker is asking for someone to read through their proof and point out any errors. They mention that they are not proficient in using LaTeX and that there may be an easier way to prove the problem. They also mention that they found an easier way while working on a different problem. They conclude that all common multiples have the form abn/gcd(a,b) as n goes from 1 to infinity.
  • #1
Fisicks
85
0
Unfortunately I lack the skills to type this proof up in latex but I'd really appreciate it if someone could read through my proof and finds the errors that I'm pretty sure exist lol. On a side note I know there must be an easier way to prove this problem but I'm still happy with what I've done.

Click on the image twice to blow it up so its readable!
 

Attachments

  • img009.jpg
    img009.jpg
    37.4 KB · Views: 486
  • img010.jpg
    img010.jpg
    21.4 KB · Views: 433
Physics news on Phys.org
  • #2
Well I actually found the easier way I talked about above working on a different problem lol. If anyone read my proof up there I found that z must equal b/gcd(a,b) thus all common multiples have the form abn/gcd(a,b) as n goes from 1 to infinity.
 

FAQ: LCM Proof: Check My Work and Find Errors | Easy Method

What is the proof of LCM(a,b)?

The proof of LCM(a,b) is a mathematical concept that shows the smallest number that is divisible by both a and b. It is also known as the least common multiple.

How do you check your work for LCM(a,b)?

To check your work for LCM(a,b), you can use the prime factorization method. This involves breaking down both numbers into their prime factors and then finding the product of the highest powers of each prime factor.

Why is it important to find the LCM of two numbers?

Finding the LCM of two numbers is important because it helps us simplify fractions, find common denominators, and solve problems involving ratios and proportions.

Can the LCM of two numbers be smaller than either of the numbers?

No, the LCM of two numbers cannot be smaller than either of the numbers. The LCM is always equal to or greater than the largest of the two numbers.

Is the LCM of two numbers always unique?

Yes, the LCM of two numbers is always unique. This means that there is only one possible answer for the LCM of any two given numbers.

Similar threads

Help understanding proof for Capon Method
Replies
6
Views
4K
MHB LCM & Meatloaf: Solving Tom's Problem
Replies
4
Views
2K
A Proof of Classical Fluctuation-Dissipation Theorem
Replies
1
Views
1K
Is Squaring an Equation Adequate for Proof in Analysis?
Replies
7
Views
2K
Help transitioning into proof-based math?
Replies
2
Views
2K
MHB Solve for upperbound of a summation to find the nearest LCM to a given #
Replies
1
Views
2K
Validity of proof method - error in book?
Replies
6
Views
2K
I need a better "method" for working out proofs and problems
Replies
4
Views
1K
Can somebody look over my proof? (Asymptotic notation and algorithms)
Replies
4
Views
2K
A Help with the Proof of an Operator Identity
Replies
1
Views
931

Hot Threads

Recent Insights

Back
Top