Proving the Theorem If m divides n, then m <= n Using Different Methods

  • Thread starter SurferStrobe
  • Start date
  • Tags
    Theorem
In summary, the conversation discusses using direct proof, mathematical induction, contraposition, or contradiction to prove a theorem. The theorem states that "If m divides n, then m <= n." The conversation goes on to explore how to prove this using a direct proof, with one participant suggesting that if m divides n, then m = nk for some integer k. Another participant points out that for k > 1, m < n(k + 1), and suggests dividing by k + 1 to show m / (k + 1) < n. Finally, there is a discussion about how to show inequality when k > 1, with one participant pointing out that if m divides n (m <= n), then m*k
  • #1
SurferStrobe

Homework Statement



Prove a theorem using direct proof, mathematical induction, contraposition, or contradiction.

Homework Equations



"If m divides n, then m <= n."

The Attempt at a Solution



(a) Suppose m divides n, then m = nk for some integer k.

(b) If k = 1, the m = n(1) = n.

That show equality part. How do I now show inequality? I'm at a loss for the next step.
 
Physics news on Phys.org
  • #2
If k is not 1, then, since it is a positive integer, k>1. What does that tell you?
 
  • #3
Given that, for k=1, m = n,

then for k > 1 (or k + 1),

m < n(k + 1).

If I divide by k + 1,

m / (k + 1) < n.

Am I on the right track?
 
Last edited by a moderator:
  • #4
SurferStrobe said:

Homework Statement



Prove a theorem using direct proof, mathematical induction, contraposition, or contradiction.

Homework Equations



"If m divides n, then m <= n."

The Attempt at a Solution



(a) Suppose m divides n, then m = nk for some integer k.

(b) If k = 1, the m = n(1) = n.

That show equality part. How do I now show inequality? I'm at a loss for the next step.

If m divides n (m<=n), then m*k=n and not m=n*k.

If k=1, m=n, if k>1,

mk=n => m<n.
 
  • #5
You're right! I missed that completely!
 
  • #6
Sleek, Thanks! I guess I got that twisted. Appreciate your helping me understand this logically.

surferstrobe
 

FAQ: Proving the Theorem If m divides n, then m <= n Using Different Methods

What is the purpose of proving basic theorems?

The purpose of proving basic theorems is to establish the validity of fundamental mathematical principles. This helps to build a strong foundation for more complex mathematical concepts and allows for the development of new theories and applications.

How do you go about proving a basic theorem?

The process of proving a basic theorem involves using logical reasoning and mathematical techniques to show that the theorem is true for all possible cases. This typically includes breaking down the theorem into smaller, more manageable parts and using previously established theorems and axioms as building blocks.

Why is it important to provide a rigorous proof for a basic theorem?

Proving a basic theorem rigorously ensures that it is universally applicable and not just a coincidence based on a few examples. It also allows for a deeper understanding of the theorem and its implications, as well as the ability to apply it to other areas of mathematics.

Can a basic theorem ever be proven wrong?

No, a basic theorem cannot be proven wrong. Once a theorem has been rigorously proven, it is accepted as a fundamental truth in mathematics. However, it is possible for a previously proven theorem to be disproven or modified by new discoveries or advancements in mathematics.

How are basic theorems used in real-world applications?

Basic theorems serve as the foundation for many practical applications in fields such as physics, engineering, and computer science. They provide a framework for understanding and solving complex problems, and can also be used to develop new technologies and innovations.

Back
Top