A positive whole number n > 2 is primed if no number between 2 and the square root of n (inclusive) evenly divides n. Write a program that accepts a value of n as input and determines if the value is prime. If n is not prime, your program should quit as soon as it finds a value that evenly divides n.
i have the basics written for this one.
def main():
n = input(Please enter your number:")
main()
You don’t
returnanything in yourwindspeed()function, only assign the result to X.Change your function to:
Furthermore, you want to modify the printing of your table – the current code produces a malformatted one. Something like this:
For more examples see this question