Project Euler 134
ProblemPrime pair connection Consider the consecutive primes p1 = 19 and p2 = 23. It can be verified that 1219 is the smallest number such that the last digits are formed by p1 whilst also being divis
Category: Ruby
Project Euler 131
ProblemPrime cube partnership There are some prime values, p, for which there exists a positive integer, n, such that the expression n3 + n2p is a perfect cube. For example, when p = 19, 83 + 82×19 =
Project Euler 123
ProblemPrime square remaindersProblem 123 Let pn be the nth prime: 2, 3, 5, 7, 11, …, and let r be the remainder when (pn−1)n + (pn+1)n is divided by pn2. For example, when n = 3, p3 = 5, and 43 + 63
Project Euler 124
ProblemOrdered radicalsProblem 124 problem is here Solution bruteforce dictionary You can define rad function by using prime_division method. And from 1 to 100000, you can get each of rad value. I
Project Euler 121
ProblemDisc game prize fundProblem 121 A bag contains one red disc and one blue disc. In a game of chance a player takes a disc at random and its colour is noted. After each turn the disc is returned
지킬에 관하여 알아낸 사실들
오늘 지킬에 대해서 알아낸 사실은 다음과 같다. Syntax highlight기능을 쓰기 위해서는 써야한다.12345678910112. ``` 앞뒤에 반드시 한 줄씩 띄워주어야 한다. 그렇지 않으면 잘못 인식된다.2. 내용 작성의 첫 줄은 부제목이다. 따라서 일정 길이 이상이 되면 자동으로 문법이 풀린다.3. github푸시 후 실제의 블로그에 적용되기