fork download
copy 
  1. for n in range(2, 10):
  2.     for x in range(2, n):
  3.         if n % x == 0:
  4.             print(n, 'equals', x, '*', n//x)
  5.     else:
  6.         # loop fell through without finding a factor
  7.         print(n, 'is a prime number')
  8.  
Success #stdin #stdout 0.01s 9992KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
2 is a prime number
3 is a prime number
4 equals 2 * 2
4 is a prime number
5 is a prime number
6 equals 2 * 3
6 equals 3 * 2
6 is a prime number
7 is a prime number
8 equals 2 * 4
8 equals 4 * 2
8 is a prime number
9 equals 3 * 3
9 is a prime number
https://ideone.com/EqSjtP
language:
Python 3 (python  3.9.5)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!