Number Logic in Programming: Prime Numbers, GCD, and Ternary Operators

1.find the range of prime numbers : Flow Chart: -In python : no1 = 10 while no1 <= 50 : div = 2 flag = True while div <= no1 // 2 : if no1 % div == 0 : flag = False break div = div + 1 if flag : print ( no1 , " is prime " ) no1 = no1 + 1 Output: -In Javascript: let no1 = 10 ; while ( no1 <= 50 ) { let div = 2 ; let flag = true ; while ( div * div <= no1 ) { if ( no1 % div === 0 ) { flag = false ; break ; } div ++ ; } if ( flag && no1 > 1 ) { console . log ( no1 + " is prime " ); } else { console . log ( no1 + " is not prime " ); } no1 ++ ; } -In Java : public class PrimeCheck { public static void main ( String [] args ) { int no1 = 10 ; while ( no1 <= 50 ) { int div = 2 ; boolean flag = true ; while ( div * div <= no1 ) { if ( no1 % div == 0 ) { flag = false ; break ; } div ++; } if ( flag && no1 > 1 ) { System . out . println ( no1 + " is prime" ); } else { System . out . println ( no1 + " is not prime" ); } no1 ++; } } } 2.Find the Greatest of Common Divisor: Flow Chart: -In Python :