CoCalc -- 1.1 Statements.sagews

Project: Math 201

Views: ⁸¹

3*11
factor(21)

33
3 * 7

n=17;
is_prime(n);#is_prime returns False if a number is composite and True if a number is prime

True

n=17;
is_prime(n);

True

n=8675309;
is_prime(n);

True

[2..20];#List of integers from 2 to 20

[2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]

prime_range(2,20);#Prints out a list of primes in the range 2 to 20

[2, 3, 5, 7, 11, 13, 17, 19]

[n for n in [2..20] if not is_prime(n)];

[4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20]

factor(2047)

23 * 89

for n in prime_range(2,50):
    n,2^n-1,is_prime(2^n-1); #Prime,Number,IsPrime

(2, 3, True)
(3, 7, True)
(5, 31, True)
(7, 127, True)
(11, 2047, False)
(13, 8191, True)
(17, 131071, True)
(19, 524287, True)
(23, 8388607, False)
(29, 536870911, False)
(31, 2147483647, True)
(37, 137438953471, False)
(41, 2199023255551, False)
(43, 8796093022207, False)
(47, 140737488355327, False)

for n in [1..50]:
    n,n^2-n+41,is_prime(n^2-n+41);#Step,Number,IsPrime

(1, 41, True)
(2, 43, True)
(3, 47, True)
(4, 53, True)
(5, 61, True)
(6, 71, True)
(7, 83, True)
(8, 97, True)
(9, 113, True)
(10, 131, True)
(11, 151, True)
(12, 173, True)
(13, 197, True)
(14, 223, True)
(15, 251, True)
(16, 281, True)
(17, 313, True)
(18, 347, True)
(19, 383, True)
(20, 421, True)
(21, 461, True)
(22, 503, True)
(23, 547, True)
(24, 593, True)
(25, 641, True)
(26, 691, True)
(27, 743, True)
(28, 797, True)
(29, 853, True)
(30, 911, True)
(31, 971, True)
(32, 1033, True)
(33, 1097, True)
(34, 1163, True)
(35, 1231, True)
(36, 1301, True)
(37, 1373, True)
(38, 1447, True)
(39, 1523, True)
(40, 1601, True)
(41, 1681, False)
(42, 1763, False)
(43, 1847, True)
(44, 1933, True)
(45, 2021, False)
(46, 2111, True)
(47, 2203, True)
(48, 2297, True)
(49, 2393, True)
(50, 2491, False)