Click on prime numbers flo for the top flow chart or finding prime numbers flo for the bottom flow chart. Count of numbers upto m with gcd equals to k when paired with m. Given a number n the task is to print all prime numbers less than or equal to n.