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

  • Context: Graduate 
  • Thread starter Thread starter epkid08
  • Start date Start date
  • Tags Tags
    Couple
Click For Summary

Discussion Overview

The discussion revolves around the mathematical functions g(x, n) and f(x), particularly focusing on the representation of remainders in integer division and the identification of integer values for functions that may yield irrational results. Participants explore alternative notations and methods for expressing these concepts.

Discussion Character

  • Technical explanation, Conceptual clarification, Debate/contested

Main Points Raised

  • Some participants propose that g(x, n) represents the remainder of x divided by n when both are integers.
  • Others discuss the possibility of expressing integer values of x for functions like f(x) = √x without direct substitution, suggesting that if f(x) is an integer, then x can be expressed as (f(x))².
  • It is noted that this approach may not apply universally to all functions, as some functions like ln(x) or sin(x) require checking specific values to determine if they yield integers.
  • Participants inquire about special notations for representing the remainder of integer division, with some suggesting "a mod b" and discussing its equivalence to other mathematical expressions.
  • There is mention of the notation "a % b" being commonly used in programming contexts, raising questions about its prevalence in mathematical literature.

Areas of Agreement / Disagreement

Participants generally agree on the definition of g(x, n) as the remainder of integer division, but there is no consensus on the best notation or method for expressing these concepts across different functions. The discussion remains unresolved regarding the applicability of certain methods to all functions.

Contextual Notes

Limitations include the dependence on specific definitions of functions and the unresolved nature of how to universally apply integer identification methods across various mathematical functions.

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.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
1
Views
2K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 9 ·
Replies
9
Views
3K