일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 일차변환
- homogeneous linear system
- 랜덤 순서 배열
- matrix-vector product
- itertools
- NumPy
- recursive algorithms
- 이진 탐색
- 코틀린 시작하기
- Big-Oh notation
- 빅세타
- matrix fo a linear transformation
- Big Theta
- solutions of matrix equation
- matrix trnasformations
- nontrivial solution
- Big Omega
- 코틀린 Hello World!
- 알고리즘 분석의 실례
- nonhomogeneous linear system
- Big-O 예제
- Big-Oh 예제
- 배열 섞기
- trivial solution
- 빅오메가
- one-to-one
- linear dependence
- python
- 빅오 표기법
- 재귀함수
- 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(10)=1111111111=11\times 41 \times 271 \times 9091\), and the sum of these prime factors is \(9414\). Find the sum of the first fort prime factors of \(R \left ( 10^9 \right ) \). 숫자 \(1\) 로만 이루어진 수를 repunit 이라고 한다. \(R(k)\) 를 \(k\) 개의 \(1\) 로 이루어진 수라고 하자. 예를 들어, \(R..
There are some prime values, \(p\), for which there exists a positive integer, \(n\), such that the expression \(n^3 + n^2 p\) is a perfect cube. For example, when \(p=19, \; 8^3 + 8^2 \times 19 = 12^3\). What is perhaps most surprising is that for each prime with this property the value of \(n\) is unique, and there are only four such primes below one-hundred. How many primes below one million ..
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 a positive integer and \({\rm GCD}(n, \;10)=1\), it can 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(4..