| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
| 30 |
- Big Theta
- linear dependence
- recursive algorithms
- matrix fo a linear transformation
- matrix trnasformations
- Big-O 예제
- 재귀함수
- 빅오 표기법
- NumPy
- 이진 탐색
- 알고리즘 분석의 실례
- 페이지 겹칩
- 일차변환
- Big-Oh 예제
- itertools
- 코틀린 시작하기
- 배열 섞기
- Big-Oh notation
- python
- includepdf
- Big Omega
- homogeneous linear system
- nonhomogeneous linear system
- 코틀린 Hello World!
- 빅세타
- one-to-one
- nontrivial solution
- 빅오메가
- 랜덤 순서 배열
- trivial solution
- Today
- Total
코딩 연습
The radical of \(n\), \({\rm rad}(n)\), is the product of distinct prime factors of \(n\). For example, \(504=2^3 \times 3^2 \times 7\), so \({\rm rad}(504)=2 \times 3 \times 7 = 42\). We shall define the triplet of positive integers \((a, \;b,\;c)\) to be an abc-hit if: 1. \({\rm GCD}(a, \;b)={\rm GCD}(a, \;c) = {\rm GCD}(b, \;c)=1\) 2. \(a
The minimum number of cubes to cover every visible face on a cuboid measuring \(3 \times 2 \times 1\) is twenty-two. If we then add a second layer to this solid it would require forty-six cubes to cover every visible face, the third layer would require seventy-eight cubes, and the fourth layer would require one hundred and eighteen cubes to cover every visible face. However, the first layer on a..
The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: \(6^2 + 7^2 + 8^2 +9^2 + 10^2 + 11^2 + 12^2\). There are exactly eleven palindromes below one-thousand that can be written as consecutive square sums, and the sum of these palindromes is \(4164\). Note that \(1 = 0^2 + 1^2\) has not been included as this problem is concerned with the squares of..