Problem
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
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
Find the greatest product of five consecutive digits in the 1000-digit number.Solve the problem using matlab.
Solution
This problem is very simple only thing that you should know is that we will not copy the number in the number format but in a string and then compute the digits derived from the string and then multiply the numbers of the consecutive numbers. See the program and you will understand every thing easily. The concepts used in the background of this are as follows:
To write the above number in multiple lines then you can use this : Continue long statement on Multiple lines - Matlab
Find the explanation below the program section
Find the explanation below the program section
Program
number = '731671765313306249192251196744........'; %copy the full number %to the string in the number variable max = 0; for i = 1:96 value = 1; n1 = str2num(number(i)); n2 = str2num(number(i+1)); n3 = str2num(number(i+2)); n4 = str2num(number(i+3)); n5 = str2num(number(i+4)); value = n1*n2*n3*n4*n5; if value > max max = value; end end disp(max)
Explanation
This program is very simple. First we will create a number variable and store the value of the number as string. Then we create a variable 'max' to store the value of the maximum value of the multiplication of the five consecutive numbers. Now we start a for loop and iterate it from 1 to 96. Let us consider the first iteration to understand the for loop.
In the first iteration the value of i is 1. Now the value of value is 1. n1 = 7, n2 = 3, n3 = 1, n4 = 6, n5 = 7.
Now the value of the value is changed to n1*n2*n3*n4*n5 = 7*3*1*6*7 = 882.
And now in this iteration the value of max is smaller than value of value and thus the value of max is changed to 882.
Finally after all the iterations we will show the value of the max.
Final Note
Run the program and post your answer below in the comment below.
The above problem has been taken from projecteuler.net and can be found here: problem 8
I have tried to explain and solve this problem in such a way that it will be easy for everyone to understand. if you didn't understand or have any doubt then please let me know. You can contact me from here: contact me.
If you have found any mistake then please let me know.
The above program has been highlighted using hilite.me.
Keywords: matlab,projecteuler.net solution, problem 8 , largest product series