Given a positive integer n, assign true to is_prime if n has no factors other than 1 and itself. (remember, m is a factor of n i

Question

atroni [7]

3 years ago

9

Given a positive integer n, assign true to is_prime if n has no factors other than 1 and itself. (remember, m is a factor of n i

f m divides n evenly.)

Mathematics

2 answers:

yawa3891 [41] · Answer 1 · 2022-03-15T04:54:54+03:00

This is the following condition in order to get the specific output for this specific problem: if is_a_prime(n): is_prime = True Now all you have to do is write is_a_prime().

For the hard code for this problem:

if n == 2:
is_prime = True
elif n % 2 == 0:
is_prime = False
else:
is_prime = True
for m in range (3, int (n * 0.5) + 1, 2):
if n % m == 0:
is_prime = False
break.

To add, a high-level programming language that is widely used for general-purpose programming, created by Guido van Rossum and first released in 1991 is called Python.

vlada-n [284] · Answer 2 · 2022-03-15T05:54:54+03:00

Below is the solution of assign true to is_prime if n has no factors other than 1 and itself.

<h3>Further explanation </h3>

Python is an interpreted, high-level, general-purpose programming language. Python is created by Guido van Rossum and first released in 1991. Its design philosophy emphasizes code readability. Python is a more productive language than Java because it is an interpretive language which is accompanied by elegant syntax and it makes an excellent choice for scripting and rapid application development in many areas. Python is a general-purpose, versatile and popular because it is concise and easy to read, and it is also a good language to have in any programmer’s stack as it can be used for everything such as web development, software development, data science applications.

Given a positive integer n, assign true to is_prime if n has no factors other than 1 and itself. And remember, m is a factor of n if m divides n evenly. So:

if n == 2:

is_prime = True

elif n % 2 == 0:

is_prime = False

else:

is_prime = True

for m in range (3, int(n**0.5)+1, 2):

if n % m == 0:

is_prime = False

<h3>Learn more</h3>