Beginner to Mathematica's question using Module

[psb01080]

Okay, this is the question that i need to solve using mathematica:

Define the function f(n) which counts the number of zeros in n if n is the integer greater than 0.
If you input 105, 1005, 10005, find f(n).


I want to use Module in this question and I just found out that i have to use "Mod", "Count" and "Floor" but still haven't figured out this. Please help!

 

[CompuChip]

Of course, IntegerDigits and Count would solve the question right away, but I suppose that's no fun

Anyway, I suggest first trying to write down a general algorithm, then programming it in a Mathematica notebook, and only in the final step putting it all in one module. For example, how would you use the functions you quoted to get the i-th digit?

 

[oswaler]

Module[{n}, f[n_] := Count[IntegerDigits[n], 0]]
f[105]
f[1005]
f[10005]

The code above defines a function f(n) using a Module, which allows for local variables to be used within the function. The function counts the number of zeros in the input integer by first converting it into a list of its digits using IntegerDigits and then using Count to count the number of zeros in the list. The Floor function is not needed in this case as we are only counting the zeros, not rounding the number. The results for the input numbers 105, 1005, and 10005 are 1, 2, and 3, respectively.