일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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
- nonhomogeneous linear system
- 코틀린 Hello World!
- matrix fo a linear transformation
- NumPy
- homogeneous linear system
- python
- 일차변환
- Big-Oh 예제
- recursive algorithms
- Big-Oh notation
- Big Omega
- Big Theta
- 랜덤 순서 배열
- solutions of matrix equation
- 빅세타
- matrix-vector product
- 배열 섞기
- 빅오메가
- linear dependence
- 빅오 표기법
- matrix trnasformations
- trivial solution
- 재귀함수
- 알고리즘 분석의 실례
- nontrivial solution
- 코틀린 시작하기
- Big-O 예제
- 이진 탐색
- itertools
- Today
- Total
코딩 연습
A number consisting entirely of ones is called a repunit. We shall define \(R(k)\) to be a repunit of length \(k\); for example \(R(6)=111111\). Given that \(n\) is positive integer and \({\rm GCD}(n, \;10) =1\), it cane be shown that there always exists a value, \(k\), for which \(R(k)\) is divisible by \(n\), and let \(A(n)\) be the least such value of \(k\); for example, \(A(7)=6\) and \(A(41..
A hexagonal tile with number \(1\) is surrounded by a ring of six hexagonal tiles, starting at "12 o'clock" and numbering the tiles \(2\) to \(7\) in an anti-clockwise direction. New rings are added in the same fashion, with the next ring being numbered \(8\) to \(19\), \(20\) to \(37\), \(38\) to \(61\), and so on. The diagram below shows the first three rings. By finding the difference between..
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