You can just look up "python ide online" on google and paste this code:
n = -1
count = 0
while n < 0:
n = int(input("We're checking to see if a number is prime or not! Enter a positive number: "))
if n % 2 == 0:
if n == 2:
print("{} is a prime number".format(n))
else:
print("{} is not a prime number".format(n))
else:
for x in range(n, 1, -1):
if n % x == 0:
count += 1
if count > 1 or n == 1:
print("{} is not a prime number".format(n))
else:
print("{} is a prime number".format(n))
I've written some code that checks to see if a number entered by the user is a prime number or not.
Sorry, but I'm not too good with pseudocode plans and all that. I hope this helps.
Even numbers are numbers whigh are divisible by 2. Therefore, the first even number is 2. A pseudocode which adds the first 100 even numbers can be written thus :
counter = 0
sum = 0
interval = 2
while counter < 100 :
sum = sum + interval
interval += 2
counter +=1
print(sum)
- A counter takes count of the number of values summed
- Initializes a variable which holds the sum of even values
- Since even numbers are divisible by 2; every factor ; increase every added value by 2
- The program ends once counter is 100
Learn more : brainly.com/question/25327166
Answer:
gcd method
Explanation:
Given
The code snippet
Required
Which method completes the code
To return the gcd of numbers, simply use the gcd method.
So: the complete code is;
<em>import math</em>
<em>math.gcd(14,35)</em>