In this section let me help you on what is all about logarithm. Keep reading if you have any doubts .. do leave your comments.
Introduction:
In mathematics, the logarithm of a number to a given base is the power or exponent to which the base must be raised in order to produce that number.(source : Wikipedia).
If x = b y, then y = log b (x), where log means logarithms, y is base of b. Let x, y be two positive real numbers and x≠1. The real number p such that xp =y is called logarithm of y to the base x. It is represented by logx y.
Non-negative real numbers are normally denoted by using Logarithms.
Solving Logarithms Problems:
In general or on mathematical induction, let X be a finite cyclic group with n elements. Let b be a generator of X; then every element g of X can be written as x = bk for some integer k. Furthermore, any two such integer’s k1 and k2, representing x will be congruent modulo n. We can thus define a function
logb: Xà-->Zn, where Zn represents the ring of integers to each g the congruence class of k modulo n.
I hope you liked reading this. May be in the next session let me help you on mathematical reasoning
Introduction:
In mathematics, the logarithm of a number to a given base is the power or exponent to which the base must be raised in order to produce that number.(source : Wikipedia).
If x = b y, then y = log b (x), where log means logarithms, y is base of b. Let x, y be two positive real numbers and x≠1. The real number p such that xp =y is called logarithm of y to the base x. It is represented by logx y.
Non-negative real numbers are normally denoted by using Logarithms.
Solving Logarithms Problems:
In general or on mathematical induction, let X be a finite cyclic group with n elements. Let b be a generator of X; then every element g of X can be written as x = bk for some integer k. Furthermore, any two such integer’s k1 and k2, representing x will be congruent modulo n. We can thus define a function
logb: Xà-->Zn, where Zn represents the ring of integers to each g the congruence class of k modulo n.
I hope you liked reading this. May be in the next session let me help you on mathematical reasoning
No comments:
Post a Comment