Relation between log function and its characteristic g

Click For Summary
SUMMARY

The discussion centers on the inequality \( g \leq \log_b n < g + 1 \), where \( b > 1 \) and \( n \) represents all natural numbers. Participants confirm that this inequality indicates that for any positive integer \( n \), the logarithm \( \log_b(n) \) is bounded by two consecutive integers \( g \) and \( g + 1 \). Examples provided include \( 2 \leq \log_{10}(100) < 3 \) and \( 1 \leq \log_{10}(13) < 2 \). The consensus is that the inequality holds true for all integers \( g \).

PREREQUISITES
  • Understanding of logarithmic functions and properties
  • Familiarity with the concept of integer bounds
  • Basic knowledge of natural numbers
  • Graphical interpretation of mathematical functions
NEXT STEPS
  • Study the properties of logarithms, focusing on base changes and inequalities
  • Explore integer functions and their characteristics in mathematical analysis
  • Investigate graphical representations of logarithmic functions
  • Learn about the implications of logarithmic inequalities in number theory
USEFUL FOR

Mathematicians, educators, and students interested in logarithmic functions, number theory, and mathematical proofs related to inequalities.

elliti123
Messages
19
Reaction score
0
I have come across this inequality:$$ g≤ log\ n <g + 1$$
We assume that the base of the log is b >1 and n is all the natural numbers. I would like to know if anyone could provide a proof regarding this and mention for what g ? Is it for all the g which are integers ?
 
Physics news on Phys.org
elliti123 said:
I have come across this inequality:$$ g≤ log\ n <g + 1$$
We assume that the base of the log is b >1 and n is all the natural numbers. I would like to know if anyone could provide a proof regarding this and mention for what g ? Is it for all the g which are integers ?

It seems to me that this is saying that, for any positive integer n, log(n) lies between two other integers, g and g + 1. For example, ##2 \le \log_{10}(100) < 3## and ##1 \le \log_{10}(13) < 2##. If you look at the graph of ##y = \log_b(x)##, this seems pretty obvious, and isn't something that would require a proof.
 
Yes i just looked at the graph it does seem to come pretty natural to mind. Thanks for the hint.
 
?? Every number, x, satisfies n\le x&lt; n+ 1 for some integer n.
 
HAHA i can't believe i did not look at it like that. Thanks.
 

Similar threads

Replies
8
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K