일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 | 31 |
- one-to-one
- trivial solution
- 재귀함수
- homogeneous linear system
- matrix-vector product
- 알고리즘 분석의 실례
- Big-O 예제
- Big-Oh 예제
- 코틀린 Hello World!
- matrix fo a linear transformation
- NumPy
- matrix trnasformations
- 코틀린 시작하기
- itertools
- recursive algorithms
- Big-Oh notation
- solutions of matrix equation
- 이진 탐색
- 빅세타
- Big Omega
- Big Theta
- 빅오메가
- python
- 빅오 표기법
- linear dependence
- 랜덤 순서 배열
- nonhomogeneous linear system
- 배열 섞기
- nontrivial solution
- 일차변환
- Today
- Total
코딩 연습
72번 문제는 다음과 같다. Consider the fraction, n/d, where n and d are positive integers. If n
69번 문제는 다음과 같다. Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of numbers less than n which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6. n Relatively Prime φ(n) n/φ(n) 2 1 1 2 3 1,2 2 1.5 4 1,3 2 2 5 1,2,3,4 4 1.25 6 1,5 2 3 7 1,2,3,4,5,6 6 1.1666... 8 1,3,5,7 4 2..
68번 문제는 다음과 같다. Consider the following "magic" 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine. Working clockwise, and starting from the group of three with the numerically lowest external node (4,3,2 in this example), each solution can be described uniquely. For example, the above solution can be described by the set: 4,3,2; 6,2,1; 5,1,3. It is possible to complete the ..