LESSON 01

1.1 Prime numbers, Factoring and divisibility

ithprime(n)
> with(numtheory);
GIgcd, bigomega, cfrac, cfracpol, cyclotomic, divisors, factorEQ, factorset, fermat, imagunit, (1)
index, integral_basis, invcfrac, invphi, iscyclotomic, issqrfree, jacobi, kronecker, l,
legendre, mcombine, mersenne, migcdex, minkowski, mipolys, mlog, mobius, mroot, msqrt,
nearestp, nthconver, nthdenom, nthnumer, nthpow, order, pdexpand, f, p, pprimroot,
primroot, quadres, rootsunity, safeprime, s, sq2factor, sum2sqr, t, thue

> ithprime(1);
2 (2)
> ithprime(10);
29 (3)
> ithprime(320);
2129 (4)
> ithprime(5639);
55589 (5)
isprime(n)
> isprime(1);
false (6)
> isprime(17);
true (7)
> isprime(45896);
false (8)
> isprime(8);
false (9)
nextprime(n)
> nextprime(3);
5 (10)
> nextprime(27);
29 (11)
> nextprime(10);
11 (12)
> nextprime(245);
251 (13)
prevprime(n)
> prevprime(3);
(14)
 2 (14)
> prevprime(44);
43 (15)
> prevprime(1587);
1583 (16)
> prevprime(10);
7 (17)
ifactor(n)
> ifactor(15);
3 5 (18)
> ifactor(44);
2
2 11 (19)
> ifactor(2019);
3 673 (20)
> ifactor(825);
2
3 5 11 (21)
irem(m,n)
> irem(152,3);
2 (22)
> irem(560,4);
0 (23)
> irem(123,3);
0 (24)
> irem(155,23);
17 (25)
irem(m,n,'q');

> irem(162,5,'q');
2 (26)
> q;
32 (27)
> irem(72,11,'q');
6 (28)
> q;
6 (29)
iquo(m,n)
> iquo(210,3);
(30)
 70 (30)
> iquo(2019,4);
504 (31)
> iquo(2019,4,'r');
504 (32)
> r;
3 (33)
> iquo(1526,7,'r');
218 (34)
> r;
0 (35)
factorial(n)
> factorial(m);
m! (36)
> factorial(3);
6 (37)
> factorial(0);
1 (38)
> factorial(-6);
Error, numeric exception: division by zero

> factorial(10);
3628800 (39)
> 10!;
3628800 (40)
1.2 Multipliers
gcd(a,b)
> gcd(45,12);
3 (41)
> gcd(2,3);
1 (42)
> gcd(364,88);
4 (43)
lcm(a,b)
> lcm(2,3);
6 (44)
> lcm(30,24);
120 (45)
1.3 Divisors
divisors(n)
> divisors(10);
1, 2, 5, 10 (46)
> divisors(20);
1, 2, 4, 5, 10, 20 (47)
> divisors(-256);
1, 2, 4, 8, 16, 32, 64, 128, 256 (48)
tau(n)
> tau(10);
4 (49)
> tau(20);
6 (50)
> tau(-256);
9 (51)
sigma[0](n)
> sigma[0](20);
6 (52)
> sigma[0](2019);
4 (53)
> sigma[0](-256);
9 (54)
1.4 Sequences
> seq(i,i=1..10);
1, 2, 3, 4, 5, 6, 7, 8, 9, 10 (55)
> seq(i^2,i=1..10);
1, 4, 9, 16, 25, 36, 49, 64, 81, 100 (56)
> seq((n+1)/n^2,n=1..10);
3 4 5 6 7 8 9 10 11
2, , , , , , , , , (57)
4 9 16 25 36 49 64 81 100
> s:=i->(i);
s := i/i (58)
> s(5);
5 (59)
> s(10);
10 (60)
> seq1:=n->((n+1)/n^2);
(61)
 n +1
seq1 := n/ 2
(61)
n
> seq1(2);
3
(62)
4
> seq1(10);
11
(63)
100
EXERCISES
1)
> gcd(143,227);
1 (64)
> gcd(143,227);
1 (65)
> gcd(306,657);
9 (66)
> lcm(306,657);
22338 (67)
> gcd(272,1479);
17 (68)
> lcm(271,1479);
400809 (69)
> gcd(1109,4999);
1 (70)
> lcm(1819,3587);
383809 (71)
2)
> isprime(509);
true (72)
> isprime(701);
true (73)
> isprime(1009);
true (74)
> isprime(129);
false (75)
> isprime(1013);
true (76)
> isprime(5478);
false (77)
> isprime(256);
false (78)
> isprime(17460);
false (79)
3)
> irem(7842,12,'q');
6 (80)
> q;
653 (81)
r=6, q=653
> iquo(3578954,55,'r');
65071 (82)
> r;
49 (83)
r=49, q=65071
> irem(48795345,789,'q');
429 (84)
> q;
61844 (85)
r=429, q=61844
4)
> ithprime(26);
101 (86)
> ithprime(46);
199 (87)
> seq(ithprime(n),n=26..46);
101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, (88)
197, 199
5)
> gcd(5,8);
1 (89)
relatively prime
> gcd(2,8);
2 (90)
not relatively prime
> gcd(14,87);
(91)
 1 (91)
relatively prime
> gcd(71,91);
1 (92)
relatively prime
> gcd(1578,87236);
2 (93)
not relatively prime
> gcd(785,569);
1 (94)
relatively prime