일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- python
- nonhomogeneous linear system
- Big-O 예제
- one-to-one
- linear dependence
- 코틀린 Hello World!
- 재귀함수
- homogeneous linear system
- Big Omega
- 이진 탐색
- Big Theta
- matrix-vector product
- itertools
- NumPy
- 빅오메가
- 빅오 표기법
- trivial solution
- 코틀린 시작하기
- Big-Oh 예제
- 빅세타
- 일차변환
- 랜덤 순서 배열
- 배열 섞기
- matrix fo a linear transformation
- recursive algorithms
- 알고리즘 분석의 실례
- matrix trnasformations
- Big-Oh notation
- solutions of matrix equation
- nontrivial solution
- Today
- Total
코딩 연습
In a\(3 \times 2\) cross-hatched grid, a total of \(37\) different rectangles could be situated withing that grid as indicated in the sketch. There are \(5\) grids smaller than \(3 \times 2\), vertical and horizontal dimensions being important, i.e. \(1 \times 1\), \(2 \times 1\), \(3 \times 1\), \(1 \times 2\) and \(2 \times 2\). If each of them is cross-hatched, the following number of differe..
The smallest positive integer \(n\) for which the numbers \(n^2 +1\), \(n^2 +3\), \(n^2+7\), \(n^2+9\), \(n^2+13\), and \(n^2+27\) are consecutive primes is \(10\). The sum of all such integers \(n\) below one-million is \(1242490\). What is the sum of all such integers \(n\) below \(150\) million? \(n^2 +1\), \(n^2 +3\), \(n^2+7\), \(n^2+9\), \(n^2+13\), \(n^2+27\) 이 연속적인 소수가 되는 최소의 자연수 \(n\) 은..
Some positive integers \(n\) have the property that the sum \([n+{\rm reverse}(n)]\) consists entirely of odd (decimal) digits. For instance, \(36+63=99\) and \(409+904=1313\). We will call such numbers reversible; so \(36, \; 63, \; 409\), and \(904\) are reversible. Leading zeroes are not allowed in either \(n\) or \({\rm reverse}(n)\). There are \(120\) reversible numbers below on-thousand. H..