Python exercise 11 - Check Primality Functions

Python exercise 11 - Check Primality Functions

'''
Ask the user for a number and determine whether the number is prime or not. (For those who have forgotten, a prime number is a number that has no divisors.). You can (and should!) use your answer to Exercise 4 to help you. Take this opportunity to practice using functions, described below.
**Discussion**
Concepts for this week:
Functions
Reusable functions
Default ar

Code:

num=int(input('please enter a number: '))
def judge_prime (num):
	a=0
	if num==1:
		a=0
	elif num ==2:
		a=1
	else:
		for i in range (2,num):
			if num%i==0:
				a+=1
	if a ==0:
		print ('The number you enter '+str(num)+' is not prime.')
	else:
		print ('The number you enter '+str(num)+' is prime. And it has '+str(a)+' divisors.')
judge_prime (num)
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值