Write an algorithm that finds a prime number larger than the given positive integer, for example the given integer is 5
please help :( discerete math :(

example, the given integer is : 5, so the next prime larger than that is 7, how to do that?

    procedure primeLarge(5)
         //code here, must be for loop
       return(prime)
     end primeLarge



Write an algorithm that finds a prime number larger than the given positive integer, for example the given integer is 5
===

please help :( discerete math :(

example, the given integer is : 5, so the next prime larger than that is 7, how to do that?

    procedure primeLarge(5)
         //code here, must be for loop
       return(prime)
     end primeLarge


