N is a prime number?

 Programe PYTHON checks if the number N is a prime number. 
The algorithm consists of dividing the number N by all successive numbers 1, 2, 3,, sqrt (N) as long as the rest of the divisions are nonzero.
The PYTHON program is:

# Checks if the number N is a prime number
N = int(input('Number is:'))
# A = sqrt(N)
A = N**0.5
B = int(A)
C = False
D = 2
while (C == False) and (D <= B):
    if(N % D) == 0:
        C = True
    D = D + 1
if (C == False):
    print ('Number', N,  'prime')
else:
    print ('Number', N,  'is not prime')


The results of the program are:

Python 3.10.2 (v3.10.2:a58ebcc701, Jan 13 2022, 14:50:16) [Clang 13.0.0 (clang-1300.0.29.30)] on darwin
Type "help", "copyright", "credits" or "license()" for more information.

================ RESTART: /Users/ionivan/Documents/NumarPrim.py ================
Number is:887
Number 887 prime

Python 3.10.2 (v3.10.2:a58ebcc701, Jan 13 2022, 14:50:16) [Clang 13.0.0 (clang-1300.0.29.30)] on darwin
Type "help", "copyright", "credits" or "license()" for more information.

================ RESTART: /Users/ionivan/Documents/NumarPrim.py ================
Number is:1000
Number 1000 is not prime





(March 22, 2022)

Comments

Post a Comment

Popular posts from this blog

Pointers in PYTHON?

 Memory programming is used in programming. A memory area is defined by: - associated variable name, - length as number of bytes, - address of the first byte, - content as a string of bits with contextual interpretation. The contents of the pointer variable are the address of a memory area. A variable is referred to when its address is loaded into a pointer variable. A pointer variable is redirected using its contents to reach the contents of the variable whose address it contains. The reference operator initializes the pointer variable. The pointer referral operator provides the contents of the memory area whose address it contains. And the PYTHON language natural works with pointer variables. PYTHON works differently and spectacular with pointers. (March 31, 2022)
Read more
 Prorgram is: # #           Equality elements lists, sets, dictionaries # Elem_A = 10 Elem_B = 10 Elem_C = 15 List_A = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] List_B = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] List_C = [1,2,3,3,3,6,7,8,9,10] Set_A = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} Set_B = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} Set_C = {1, 2, 3, 3, 3, 3, 7, 8, 9, 10} Dictionary_A = {1:1, 2:2, 3:3, 4:4, 5:5, 6:6, 7:7, 8:8, 9:9, 10:10} Dictionary_B = {1:1, 2:2, 3:3, 4:4, 5:5, 6:6, 7:7, 8:8, 9:9, 10:10} Dictionary_C = {1:1, 2:2, 3:3, 4:3, 5:3, 6:3, 7:7, 8:8, 9:9, 10:10} def compare(X,Y):     if X == Y:         Alfa = True     else:         Alfa = False     return Alfa print(' Element equality') Elem_Test_AB = compare(Elem_A,Elem_B) print('Element A is equal to element B? Result is:', Elem_Test_AB) Elem_Test_AC = compare(Elem_A,Elem_C) print('Element A is equal to element C? Result is:', Elem_Test_AC) print(' Lis...
Read more

Generates M prime numbers

Programe is: # Generates M prime numbers, M > 1 M = int(input('Number of prime numbers  are:')) print ('Prime numbers list is:') print (1,  '  ') print (2,  '  ') print (3,  '  ') # MM = M  K = 1 N = 3 while K <= M:     A = N**0.5     B = int(A)     C = False     D = 2     while (C == False) and (D <= B):         if(N % D) == 0:             C = True         D = D + 1     if (C == False):         print ( N,  '  ')     N = N + 2     K = K + 1 print ('The list was successfully printed') Results are:  Python 3.10.2 (v3.10.2:a58ebcc701, Jan 13 2022, 14:50:16) [Clang 13.0.0 (clang-1300.0.29.30)] on darwin Type "help", "copyright", "credits" or "license()" for more information. ========= RESTART: /Users/ionivan/Documents/GenerareListaNumerePrime.py ======== Number...
Read more