Solving g(x, n) and Finding Integers in f(x)

  • Thread starter Thread starter epkid08
  • Start date Start date
  • Tags Tags
    Couple
AI Thread Summary
The discussion revolves around the function g(x, n) defined as D(x/n) multiplied by n, where D(h) expands h into a sum of its place values and subtracts terms greater than or equal to one. It explores alternative representations for functions like f(x) = √x to find integer values without manual checking, noting that for certain functions, such as logarithmic ones, integer values can be derived directly. However, for functions like ln(x) and sin(x), integer solutions require substitution and verification. The conversation also touches on notations for representing the remainder of integer division, with "a mod b" and "a % b" being commonly used, particularly in programming contexts. Overall, the thread highlights the mathematical exploration of functions and their integer solutions.
epkid08
Messages
264
Reaction score
1
Is there a better way to write this:

g(x, n) = D(\frac{x}{n})*(n)

Where D(h), unless already a decimal, expands h into a sum of its places i.e. 47=40+7, then subtracts all of the terms that are greater than or equal to one.



Also, if I have a function, say f(x) = \sqrt{x}, and I only wanted the integer values of x that made f(x) an integer, is there a different way of writing this, where I wouldn't have to plug in and check?(this goes for any function, where irrationality is possible or not)
 
Mathematics news on Phys.org
g(x,n) is the remainder of \frac{x}{n}, if x and n are integers.



For f(x)=\sqrt{x}, it is possible [x=(f(x))[SUP]2[/SUP], f(x)>0; i.e. if f(x) is an integer, then x is an integer].

Another example would be f(x) = loga (x) [a>0 is an integer]; with x=af(x), so if f(x) is an integer, then x is also an integer.

But it is not possible for EVERY function, such as ln(x), sin(x), etc. For these, you would need to substitute and find out if they work (if there were an integer that would yield an integer value).
 
ForMyThunder said:
g(x,n) is the remainder of \frac{x}{n}, if x and n are integers.

Is there any special notation to represent the remainder of integer division?

Is there any special notation (I thought there was here) to represent the remainder of integer division multiplied by the denominator integer?
 
epkid08 said:
Is there any special notation to represent the remainder of integer division?

Is there any special notation (I thought there was here) to represent the remainder of integer division multiplied by the denominator integer?

a mod b
gives the remainder when a is divided by b
 
To put it another way, a \equiv b (mod m) \Leftrightarrow m|(a-b) \Leftrightarrow a = km + b

Thus, a and b have the same remainder upon division by m.
 
ForMyThunder said:
a mod b
gives the remainder when a is divided by b

Yes, and that's sometimes written a%b, just like a\times b is sometimes written a*b.
 
CRGreathouse said:
Yes, and that's sometimes written a%b, just like a\times b is sometimes written a*b.

Isn't the a%b notation usually used in computer programming? I just didn't think they used it much in mathematics.
 
ForMyThunder said:
Isn't the a%b notation usually used in computer programming? I just didn't think they used it much in mathematics.

% and * are both used in programming, in emails, and other places where a rich symbol set is not easily available.
 
Back
Top