给定一个整数判断是否为素数
检查素数 (Checking prime number)
Before getting into writing the code, let us understand what exactly the prime numbers are? So that we could easily design its logic and implement it in the code. Prime numbers are those numbers which can only be divisible by itself or 1. So, we will design a code which can fulfill the property of prime numbers.
在编写代码之前,让我们了解素数到底是什么? 这样我们就可以轻松设计其逻辑并在代码中实现它。 质数是那些只能被自身或1整除的数。因此,我们将设计一个可以满足质数性质的代码。
Methods used:
使用的方法:
puts: For giving the output as well as a message to the user.
puts :用于向用户提供输出和消息。
gets: For taking the input from the user.
g