Sudal's Garage

Question: In the 20×20 grid below, four numbers along a diagonal line have been marked in red.08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80 24 4..

Implicit Euler Method 를 구현한다 function [T,Y] = odeIEuler(odefun,t,y0) Y = zeros(length(t),1); Y(1) = y0; T = t; for n = 1:length(t) - 1 h = T(n+1) - T(n); Y(n+1) = fzero(@(y) y - Y(n) - odefun(T(n+1),y) * h,0); end end Forward, Backward and central difference formulas 를 이용해 Local Truncation Error 를 구현하는 script를 구현%% (a) clear; close; fun = @(x) sin(sqrt(x)); x = 2; k = 0:1:5; fw = zeros(length(k)..

Question: The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.Find the sum of all the primes below two million.문제:10 이하의 소수들의 합은 2 + 3 + 5 + 7 = 17이다.2백만 이하의 소수들의 총합을 구하여라. Solution: 1234567891011from sympy import isprimeimport timei = 1start = time.time()sum = 0while i

Question: A Pythagorean triplet is a set of three natural numbers, a

Question: The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 66896648950445244523161731856403098711121722383113 622298934233803081353362766..