B Looking for a specific periodic function

AI Thread Summary
A function that outputs 1 for multiples of a chosen number and 0 otherwise can be defined using the MOD function, where MOD(n, d) returns 0 if n is a multiple of d. The proposed mathematical expressions, including the use of the floor function and Fourier series, aim to achieve similar results but may not be straightforward. The explicit function f_m(x) incorporates a series to express periodic behavior, while the computer programming approach simplifies the task using conditional statements. Overall, the discussion emphasizes the need for clarity in defining periodic functions within natural number constraints.
al4n
Messages
17
Reaction score
0
TL;DR Summary
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.
 
Thread 'Video on imaginary numbers and some queries'
Hi, I was watching the following video. I found some points confusing. Could you please help me to understand the gaps? Thanks, in advance! Question 1: Around 4:22, the video says the following. So for those mathematicians, negative numbers didn't exist. You could subtract, that is find the difference between two positive quantities, but you couldn't have a negative answer or negative coefficients. Mathematicians were so averse to negative numbers that there was no single quadratic...
Thread 'Unit Circle Double Angle Derivations'
Here I made a terrible mistake of assuming this to be an equilateral triangle and set 2sinx=1 => x=pi/6. Although this did derive the double angle formulas it also led into a terrible mess trying to find all the combinations of sides. I must have been tired and just assumed 6x=180 and 2sinx=1. By that time, I was so mindset that I nearly scolded a person for even saying 90-x. I wonder if this is a case of biased observation that seeks to dis credit me like Jesus of Nazareth since in reality...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Back
Top