MHB Proof of Equality for Odd Integers with Floor Function

  • Thread starter Thread starter tmt1
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary
SUMMARY

The proof of equality for odd integers using the floor function is established as follows: for an odd integer \( n = 2k + 1 \), it holds that \( \left\lfloor{\frac{n}{2}}\right\rfloor = \left\lfloor{ \frac{n - 1}{ 2}}\right\rfloor \). This is demonstrated by simplifying \( \left\lfloor{\frac{2k + 1}{2}}\right\rfloor \) to \( \left\lfloor{k + \frac{1}{2}}\right\rfloor \), which equals \( k \). Since \( k \) is defined as \( \frac{n - 1}{2} \), the proof is valid and sufficient.

PREREQUISITES
  • Understanding of the floor function in mathematics
  • Basic knowledge of odd integers and their properties
  • Familiarity with algebraic manipulation
  • Concept of integer division
NEXT STEPS
  • Study the properties of the floor function in greater detail
  • Explore proofs involving even and odd integers
  • Learn about mathematical induction as a proof technique
  • Investigate the implications of integer division in programming languages
USEFUL FOR

Mathematicians, educators, students studying number theory, and anyone interested in proofs involving the floor function and odd integers.

tmt1
Messages
230
Reaction score
0
I need to prove or disprove that

$$ \left\lfloor{\frac{n}{2}}\right\rfloor= \left\lfloor{ \frac{n - 1}{ 2}}\right\rfloor$$ where n is an odd integer.I start with something like,

$$\left\lfloor{\frac{2k + 1}{2}}\right\rfloor$$

and then

$$\left\lfloor{k + \frac{1}{2}}\right\rfloor$$ which equals $$k$$

But

$$ k = \frac{n - 1}{2}$$

So is that enough proof for the question? or is it wrong?
 
Physics news on Phys.org
tmt said:
I need to prove or disprove that

$$ \left\lfloor{\frac{n}{2}}\right\rfloor= \left\lfloor{ \frac{n - 1}{ 2}}\right\rfloor$$ where n is an odd integer.I start with something like,

$$\left\lfloor{\frac{2k + 1}{2}}\right\rfloor$$

and then

$$\left\lfloor{k + \frac{1}{2}}\right\rfloor$$ which equals $$k$$

But

$$ k = \frac{n - 1}{2}$$

So is that enough proof for the question? or is it wrong?
as n is odd a and n = 2k+1 so $ k = \frac{n - 1}{2}$ so it should be sufficient
 
If there are an infinite number of natural numbers, and an infinite number of fractions in between any two natural numbers, and an infinite number of fractions in between any two of those fractions, and an infinite number of fractions in between any two of those fractions, and an infinite number of fractions in between any two of those fractions, and... then that must mean that there are not only infinite infinities, but an infinite number of those infinities. and an infinite number of those...

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
1K