Problem 981. Find nearest prime number less than input number

Created by Reza Ahmadzadeh

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","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\"?><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 nearest prime number less than input number.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>For example: if the input number is 125, then the nearest prime number which is less than this number is 113.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Be careful, in that 1 is not a prime number. So there is NO prime less than 2.</w:t></w:r></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>"}]}

Solve

Solution Stats

2171 Solutions
585 Solvers

Last Solution submitted on Jun 05, 2023

Last 200 Solutions

Problem Comments

8 Comments

8 Comments

Show 5 older comments

@bmtran (Bryant Tran) on 10 Oct 2012

1 isn't a prime number

Disha on 31 Jul 2013

agree @bmtran...

Grzegorz Knor on 20 Sep 2013

You should correct the test suite. 1 isn't a prime number.

Vishal on 6 Oct 2014

Correct the test suite 1 is not prime number.

Daniel Pereira on 6 May 2016

1 is not a prime number, in order to fulfill with the fundamental theorem of arithmetic:

https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic

https://en.wikipedia.org/wiki/Prime_number#Primality_of_one

John D'Errico on 22 Feb 2018

I removed the test case where n==2, since 1 is indeed not a prime number. I also added a random test case, so the problem is not so easily cooked by knowing all the test cases.

Brandon on 30 May 2023 at 19:27

1 is indeed prime. Aliens will laugh at us when we say it is not. 1 causes all sorts of problems by not being prime. As many as it causes by being prime. It is already an exception in thousands of mathematical theorems. Why mathematicians chose this one theorem to not include 1 as an exception is beyond me.

Christian Schröder on 31 May 2023 at 6:25

1 is a unit (in the ring-theoretic sense), and units are excluded from the definitions of prime elements and irreducible elements in rings. I'm not a mathematician and don't have more than a basic undergrad exposure to abstract rings, but there surely is a good reason. Any mathematicians reading this who can shed on light on this?

Solution Comments

Show comments

Problem Recent Solvers585

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 981. Find nearest prime number less than input number

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers585

Suggested Problems

More from this Author11

Problem Tags

Community Treasure Hunt

Problem 981. Find nearest prime number less than input number

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers585

Suggested Problems

More from this Author11

Problem Tags

Community Treasure Hunt

Players