summary: this is the summ for EX001

CHALLENGE XX

  • Chal002 - golang

    finding even fib Numbers

     Posted on January 1, 0001  |  1 minutes  |  146 words  |  vincent youmans

    P0002 - finding even fib Numbers

    “Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:

    1, 2, 3, 5, 8, 13, 21, 34, 55, 89, …

    By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.”

    [Read More]
    GoLang  Challenge 

  • Chal003 - w10

    Code Challenge 003

     Posted on January 1, 0001  |  1 minutes  |  78 words  |  vincent youmans

    Problem 3 — Largest prime factor “The prime factors of 13195 are 5, 7, 13 and 29.

    What is the largest prime factor of the number 600851475143?”

    [Read More]
    GoLang  Challenge 

  • Chal004 - w10

    Code Challenge 004

     Posted on January 1, 0001  |  2 minutes  |  343 words  |  vincent youmans

    Problem 4 — Largest palindrome product

    “A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.

    Find the largest palindrome made from the product of two 3-digit numbers.”

    [Read More]
    GoLang  Challenge 

  • Chal005 - w10

    Code Challenge 005

     Posted on January 1, 0001  |  2 minutes  |  258 words  |  vincent youmans

    Problem 5 — Smallest multiple

    “2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.

    What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?”

    So…

    2520 / 1 remainder 0 2520 / 2 remainder 0 2520 / 3 remainder 0 2520 / 4 remainder 0 2520 / 5 remainder 0 2520 / 6 remainder 0 2520 / 7 remainder 0 2520 / 8 remainder 0 2520 / 9 remainder 0 2520 / 10 remainder 0

    answer 232792560

    [Read More]
    GoLang  Challenge 

  • Chal006 - w10

    Code Challenge 006

     Posted on January 1, 0001  |  1 minutes  |  199 words  |  vincent youmans

    Problem 6 — Sum square difference “The sum of the squares of the first ten natural numbers is, ‘‘‘1^2 + 2^2 + 3^2 … + 10^2 = 385’’’ The square of the sum of the first ten natural numbers is, (1+2+3...+10)^2 = 55^2 = 3025 Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is . Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum. [Read More]
    GoLang  Challenge 

  • Chal007 - w10

    Code Challenge 007

     Posted on January 1, 0001  |  2 minutes  |  258 words  |  vincent youmans

    Problem 7–10001st prime “By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10 001st prime number?” answer is 104743… but could be wrong or its… 104729 not sure the answer need to study more. package main import ( "fmt" "math" ) const FindPrimNumner = 10000 func main() { fmt.Println("======= version 1 =========") // just checking if isPrime Works fmt. [Read More]
    GoLang  Challenge 

  • Chal008 - w10

    Code Challenge 008

     Posted on January 1, 0001  |  2 minutes  |  247 words  |  vincent youmans

    “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 62229893423380308135336276614282806444486645238749 30358907296290491560440772390713810515859307960866 70172427121883998797908792274921901699720888093776 65727333001053367881220235421809751254540594752243 52584907711670556013604839586446706324415722155397 53697817977846174064955149290862569321978468622482 83972241375657056057490261407972968652414535100474 82166370484403199890008895243450658541227588666881 16427171479924442928230863465674813919123162824586 17866458359124566529476545682848912883142607690042 24219022671055626321111109370544217506941658960408 07198403850962455444362981230987879927244284909188 84580156166097919133875499200524063689912560717606 05886116467109405077541002256983155200055935729725 71636269561882670428252483600823257530420752963450 Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?” fyi… The code to convert a digit-char to an int is very common. [Read More]
    GoLang  Challenge 

  • Chal009 - w10

    Code Challenge 009

     Posted on January 1, 0001  |  1 minutes  |  164 words  |  vincent youmans

    Problem 9 — Special Pythagorean triplet “Pythagorean triplet is a set of three natural numbers, a < b < c, for which, a^2 + b^2 = c^2 // wrong - For example, 32 + 42 = 9 + 16 = 25 = 52. There exists exactly one Pythagorean triplet for which a + b + c = 1000.” Add img.png here * package main import "fmt" func main() { var output = 0 out: for a := 1; a < 1000; a++ { for b := 1; b < 1000; b++ { for c := 1; c < 1000; c++ { f1 := (a*a)+(b*b) == (c * c) f2 := (a + b + c) == 1000 f3 := (a < b) f4 := (b < c) if f1 && f2 && f3 && f4 { fmt. [Read More]
    GoLang  Challenge 

  • Chal010 - w10

    Code Challenge 010

     Posted on January 1, 0001  |  1 minutes  |  142 words  |  vincent youmans

    Problem 10 — Summation of primes “The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million.” For this one, we will need to re-use our isPrime() function. Basically, we need to go from 2 to the 2000000 and check every number. If it is prime, then add it up to a variable. 142913828922 [Read More]
    GoLang  Challenge 

  • Chal011a - w10

    Code Challenge 011a

     Posted on January 1, 0001  |  17 minutes  |  3584 words  |  vincent youmans

    Problem 11A — Largest product in a grid “In the 20×20 grid below, four numbers along a diagonal line have been marked in red. The product of these numbers is 26 × 63 × 78 × 14 = 1788696. What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20×20 grid? const ( grid = 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 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48 gridRowLen = 20 adjacent = 4 ) [Read More]
    GoLang  Challenge 

  • Chal011b - w10

    Code Challenge 011b. Another strategy

     Posted on January 1, 0001  |  25 minutes  |  5318 words  |  vincent youmans

    Problem 11b — Largest product in a grid “In the 20×20 grid below, four numbers along a diagonal line have been marked in red. The product of these numbers is 26 × 63 × 78 × 14 = 1788696. What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20×20 grid? const ( grid = 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 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48 gridRowLen = 20 adjacent = 4 ) [Read More]
    GoLang  Challenge 

  • Chal1001 - Golang

    A GoRoutines Problem

     Posted on January 1, 0001  |  1 minutes  |  187 words  |  vincent youmans

    Modify this code as commented. //============= version 1 func generateKey() int { fmt.Println("Generating key") // Super-secret algorithm! keys := []int{3, 5, 7, 11} key := keys[rand.Intn(len(keys))] // It's kinda slow! time.Sleep(3 * time.Second) fmt.Println("Done generating") return key } func main() { rand.Seed(time.Now().Unix()) for i := 0; i < 3; i++ { go generateKey() } fmt.Println("All done!") } ANSWER package main import ( "fmt" "math/rand" "time" ) // Update this function to accept a channel parameter, // and remove the return value. [Read More]
    GoLang  Challenge