title: C - Recursive function smaller prime numbers
body: <p>i got this exercise where it wants me to create a function to check if a number is "Prime", and than create another function to print how many smaller prime numbers are there from the one i checked. The thing is i need to create a recursive function to check the number of smaller prime numbers using the first function(the one that checks if a number is prime or not). This is what i got so far, and i'm stuck here. The recursive function is confusing for me.</p>
  
  <pre><code>#include &lt;stdio.h&gt;
  
  int main() {
     int a;
     scanf("%d", &amp;a);
     checkPrime(a);
     smallerPrime(a);
  }
  
  int checkPrime (int number) {
      if(number % 2 == 0) {
          return 1;
      } else {
          return 0;
      }
  }
  int smallerPrime (int number) {
          if(checkPrime(number) % 2 != 0){
              return ;
          } else {
              return ;
          }
  }
  </code></pre>