# 바아읏원

## 2025 days 전, tmddnjs513 작성

A = Set([1,2,3]); A
 {1, 2, 3} {1, 2, 3}
B = Set([8,6,17,-4,20, -2 ])
powA = A.subsets(); powA
 Subsets of {1, 2, 3} Subsets of {1, 2, 3}
pairsA = A.subsets(2); pairsA
 Subsets of {1, 2, 3} of size 2 Subsets of {1, 2, 3} of size 2
[11,13,15..30]
 [11, 13, 15, 17, 19, 21, 23, 25, 27, 29] [11, 13, 15, 17, 19, 21, 23, 25, 27, 29]
[21,24,27..100]
 [21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 75, 78, 81, 84, 87, 90, 93, 96, 99] [21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 75, 78, 81, 84, 87, 90, 93, 96, 99]
2^6
 64 64
[tan(x) for x in [0, pi/4..pi]]
 [0, 1, Infinity, -1, 0] [0, 1, Infinity, -1, 0]
14//4
 3 3
47568//1238
 38 38
divmod(205,4)
 (51, 1) (51, 1)
3.divides(15)
 True True
12.divisors()
 [1, 2, 3, 4, 6, 12] [1, 2, 3, 4, 6, 12]
153.is_prime()
 False False
62.factor()
 2 * 31 2 * 31
gcd(14,63)
 7 7
lcm(4,5)
 20 20
3.divides(234878)
 False False
134.divisors()
 [1, 2, 67, 134] [1, 2, 67, 134]
491.divisors()
 [1, 491] [1, 491]
422.divisors()
 [1, 2, 211, 422] [1, 2, 211, 422]
1002.divisors()
 [1, 2, 3, 6, 167, 334, 501, 1002] [1, 2, 3, 6, 167, 334, 501, 1002]
1002.prime_divisors()
 [2, 3, 167] [2, 3, 167]
422.prime_divisors()
 [2, 211] [2, 211]
491.prime_divisors()
 [491] [491]
134.prime_divisors()
 [2, 67] [2, 67]
(1
 (1, 2, 3) (1, 2, 3)
max(889080989088890808890890,88908908989089089008908)
 889080989088890808890890 889080989088890808890890