Looking for a specific periodic function

Click For Summary
SUMMARY

The discussion focuses on creating a periodic function that outputs 1 for multiples of a chosen natural number and 0 otherwise. The proposed mathematical function is defined as f_m(x) = g_m(x) + 1/2 + (1/π)Σ(sin(2πj g_m(x))/j), where g_m(x) = -1/2 + (1/π)Σ(sin(2πk(x/m))/k). Additionally, the MOD function is highlighted as a practical programming tool to determine if a number is a multiple of another, specifically using MOD(n, d) == 0 to return true for multiples.

PREREQUISITES
  • Understanding of periodic functions and their properties
  • Familiarity with the floor function and its mathematical implications
  • Knowledge of Fourier series and their applications
  • Basic programming skills, particularly in using the MOD function
NEXT STEPS
  • Research the properties of periodic functions in mathematics
  • Learn about the implementation of the floor function in various programming languages
  • Study Fourier series and their role in approximating functions
  • Explore the use of the MOD function in different programming contexts
USEFUL FOR

Mathematicians, computer scientists, and programmers interested in creating periodic functions and understanding their applications in programming and mathematical analysis.

al4n
Messages
17
Reaction score
0
TL;DR
Trying to come up with a function that outputs 1 when input is some multiple of a given number and outputs 0 if otherwise.
Is there a function that outputs a 1 when the input is a multiple of a number of your choice and 0 if otherwise. The input is also restricted to natural numbers.
The only thing I can come up with is something of the form:
f(x) = [sin(ax)+1]/2
but this does not output a 0 when I want it.
 
Mathematics news on Phys.org
How about
[\ [\frac{x}{m}]-\frac{x}{m}\ ]+1
where [ ] is floor function ?
 
Last edited:
anuttarasammyak said:
How about
[\ [\frac{x}{m}]-\frac{x}{m}\ ]+1
where [ ] is floor function ?
Is it mathematically sound? I generally avoid such functions because im not quite comfortable with them
 
You may find Fourier series expression of the floor function e.g., in
https://en.wikipedia.org/wiki/Floor_and_ceiling_functions if it is your favour.

[EDIT] Explicitly our function f_m(x) is
f_m(x)=g_m(x)+\frac{1}{2}+\frac{1}{\pi}\sum_{j=1}^\infty\frac{\sin 2\pi j g_m(x)}{j}
where
g_m(x)=-\frac{1}{2}+\frac{1}{\pi}\sum_{k=1}^\infty\frac{\sin 2\pi k \frac{x}{m}}{k}
 
Last edited:
In a computer program, the MOD function, MOD(n,d), will divide one natural number, n, by another natural number, d, and return the remainder. So if n is a multiple of d, it will return a 0. So the formula (MOD(n, d) == 0) should be true (one) when n is a multiple of d and false (zero) otherwise.

If you have a particular computer language in mind, we can be more specific.
 

Similar threads

Replies
8
Views
2K
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 4 ·
Replies
4
Views
5K
  • · Replies 13 ·
Replies
13
Views
2K
Replies
7
Views
2K