Problem 246. Project Euler: Problem 8, Find largest product in a large string of numbers

Created by Doug Hull

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Find the greatest product of five consecutive digits in an n-digit number.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843 8586156078911294949545950173795833195285320880551112540698747158523863050715693290963295227443043557 6689664895044524452316173185640309871112172238311362229893423380308135336276614282806444486645238749 3035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776 6572733300105336788122023542180975125454059475224352584907711670556013604839586446706324415722155397 5369781797784617406495514929086256932197846862248283972241375657056057490261407972968652414535100474 8216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586 1786645835912456652947654568284891288314260769004224219022671055626321111109370544217506941658960408 0719840385096245544436298123098787992724428490918884580156166097919133875499200524063689912560717606 0588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The large number will be given as a string, 1xn characters.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Thank you to</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://projecteuler.net/problem=8\"><w:r><w:t>Project Euler Problem 8</w:t></w:r></w:hyperlink></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Find the greatest product of five consecutive digits in an n-digit number.7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843
8586156078911294949545950173795833195285320880551112540698747158523863050715693290963295227443043557
6689664895044524452316173185640309871112172238311362229893423380308135336276614282806444486645238749
3035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776
6572733300105336788122023542180975125454059475224352584907711670556013604839586446706324415722155397
5369781797784617406495514929086256932197846862248283972241375657056057490261407972968652414535100474
8216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586
1786645835912456652947654568284891288314260769004224219022671055626321111109370544217506941658960408
0719840385096245544436298123098787992724428490918884580156166097919133875499200524063689912560717606
0588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450The large number will be given as a string, 1xn characters.Thank you to <a href="http://projecteuler.net/problem=8">Project Euler Problem 8</a>

Find the greatest product of five consecutive digits in an n-digit number.

7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843
8586156078911294949545950173795833195285320880551112540698747158523863050715693290963295227443043557
6689664895044524452316173185640309871112172238311362229893423380308135336276614282806444486645238749
3035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776
6572733300105336788122023542180975125454059475224352584907711670556013604839586446706324415722155397
5369781797784617406495514929086256932197846862248283972241375657056057490261407972968652414535100474
8216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586
1786645835912456652947654568284891288314260769004224219022671055626321111109370544217506941658960408
0719840385096245544436298123098787992724428490918884580156166097919133875499200524063689912560717606
0588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450

The large number will be given as a string, 1xn characters.

Thank you to <http://projecteuler.net/problem=8 Project Euler Problem 8>

Solve

Solution Stats

1903 Solutions
743 Solvers

Last Solution submitted on Aug 10, 2022

Last 200 Solutions

Problem Comments

3 Comments

3 Comments

Gareth Lee on 23 Apr 2015

your problem need the result is: 'The large number will be given as a string, 1xn characters.', but your test suits given is double

ashkan on 2 Nov 2021

hi i have a problem with the fact that how to convert this series into columns of a matrix in double without changing the arrangement ?
any advise on this would much appreciated thankyou

GeeTwo on 24 Jun 2022

The problem isn't clear. I thought I was looking for the location of the largest of one of string(prod(0:4), prod(1:5), .. prod(5:9)) in the text. But the answers are way larger than either these numbers, or the length of the string.

Solution Comments

Solution 121390

1 Comment

1 Comment

Jean-Marie Sainthillier on 7 Aug 2012

Graceful with the max(a) in the loop

Solution 27125

2 Comments

2 Comments

@bmtran (Bryant Tran) on 3 Feb 2012

Sent from my Kindle Fire

Franck Dernoncourt on 3 Feb 2012

Problem Recent Solvers743

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 246. Project Euler: Problem 8, Find largest product in a large string of numbers

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers743

Suggested Problems

More from this Author51

Problem Tags

Community Treasure Hunt

Problem 246. Project Euler: Problem 8, Find largest product in a large string of numbers

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers743

Suggested Problems

More from this Author51

Problem Tags

Community Treasure Hunt

Players