{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2025-12-14T01:33:56.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2025-12-14T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":49860,"title":"Consecutive Prime Numbers","description":null,"description_html":"\u003cdiv style = \"text-align: start; line-height: 20.44px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: none solid rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 84px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 42px; transform-origin: 407px 42px; vertical-align: baseline; \"\u003e\u003cdiv style=\"font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 42px; text-align: left; transform-origin: 384px 42px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eThe closest consecutive prime numbers are 2 and 3 which only differ by 1. Other consecutive prime numbers will differ by an even number. For example, 3 and 5 as well as 5 and 7 differ by 2. Find an example of a pair of consecutive prime numbers for each of the required difference specify in the problem. There is no unique answer for each case; so, your answers will be checked against the requirement.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = prime_space(n)\r\n  y = [2 3];\r\nend","test_suite":"%%\r\nn=2;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=4;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=6;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=8;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=10;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=12;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=24;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=30;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=50;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=60;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":180632,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":25,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2021-01-18T14:51:02.000Z","updated_at":"2026-03-03T22:04:29.000Z","published_at":"2021-01-18T14:51:02.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe closest consecutive prime numbers are 2 and 3 which only differ by 1. Other consecutive prime numbers will differ by an even number. For example, 3 and 5 as well as 5 and 7 differ by 2. Find an example of a pair of consecutive prime numbers for each of the required difference specify in the problem. There is no unique answer for each case; so, your answers will be checked against the requirement.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"},{"id":49855,"title":"Concatenated Consecutive Prime","description":null,"description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 63px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 31.5px; transform-origin: 407px 31.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 383.5px 8px; transform-origin: 383.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eAs the name suggested, Concatenated Consecutive Prime is a prime number formed by concatenating consecutive prime numbers. For a given number of constituting primes (defined as \"n\"), please output a vector containing n consecutive primes that satisfy this problem. There is no unique answer, so your results will be evaluated against the requirements.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = ccp(n)\r\n  y = [2 3 5 7 11 13 17 19];\r\nend","test_suite":"%%\r\nn=2;\r\ncc_answer=ccp(n);\r\nb=num2str(cc_answer(:));\r\ncombine=b(1,:);\r\nfor i=2:n\r\n   combine=strcat(combine,strtrim(b(i,:))); \r\nend\r\naa=primes(cc_answer(n));\r\nassert(isprime(str2num(combine)))\r\nfor i=1:n-1\r\n   assert(cc_answer(end-i)==aa(end-i))\r\nend\r\n\r\n%%\r\nn=3;\r\ncc_answer=ccp(n);\r\nb=num2str(cc_answer(:));\r\ncombine=b(1,:);\r\nfor i=2:n\r\n   combine=strcat(combine,strtrim(b(i,:))); \r\nend\r\naa=primes(cc_answer(n));\r\nassert(isprime(str2num(combine)))\r\nfor i=1:n-1\r\n   assert(cc_answer(end-i)==aa(end-i))\r\nend\r\n\r\n%%\r\nn=4;\r\ncc_answer=ccp(n);\r\nb=num2str(cc_answer(:));\r\ncombine=b(1,:);\r\nfor i=2:n\r\n   combine=strcat(combine,strtrim(b(i,:))); \r\nend\r\naa=primes(cc_answer(n));\r\nassert(isprime(str2num(combine)))\r\nfor i=1:n-1\r\n   assert(cc_answer(end-i)==aa(end-i))\r\nend\r\n\r\n%%\r\nn=5;\r\ncc_answer=ccp(n);\r\nb=num2str(cc_answer(:));\r\ncombine=b(1,:);\r\nfor i=2:n\r\n   combine=strcat(combine,strtrim(b(i,:))); \r\nend\r\naa=primes(cc_answer(n));\r\nassert(isprime(str2num(combine)))\r\nfor i=1:n-1\r\n   assert(cc_answer(end-i)==aa(end-i))\r\nend\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":4,"created_by":180632,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":17,"test_suite_updated_at":"2021-01-19T11:29:35.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2021-01-17T23:20:39.000Z","updated_at":"2025-08-14T01:54:24.000Z","published_at":"2021-01-17T23:20:39.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAs the name suggested, Concatenated Consecutive Prime is a prime number formed by concatenating consecutive prime numbers. For a given number of constituting primes (defined as \\\"n\\\"), please output a vector containing n consecutive primes that satisfy this problem. There is no unique answer, so your results will be evaluated against the requirements.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"},{"id":525,"title":"Mersenne Primes","description":"A Mersenne prime is a prime number of the form M = 2^p - 1, where p is another prime number.  For example, 31 is a Mersenne prime because 31 = 2^5 - 1 and both 31 and 5 are prime numbers.\r\n\r\nImplement the function isMersenne(x) so that it returns true if x is a Mersenne prime and false otherwise.  Your solution should work for all positive integer values of x less than 1,000,000,000 (one billion).","description_html":"\u003cp\u003eA Mersenne prime is a prime number of the form M = 2^p - 1, where p is another prime number.  For example, 31 is a Mersenne prime because 31 = 2^5 - 1 and both 31 and 5 are prime numbers.\u003c/p\u003e\u003cp\u003eImplement the function isMersenne(x) so that it returns true if x is a Mersenne prime and false otherwise.  Your solution should work for all positive integer values of x less than 1,000,000,000 (one billion).\u003c/p\u003e","function_template":"function y = isMersenne(x)\r\n  y = false;\r\nend","test_suite":"%%\r\nx = 3;\r\ny_correct = true;\r\nassert(isequal(isMersenne(x),y_correct))\r\n\r\n%%\r\nx = 127;\r\ny_correct = true;\r\nassert(isequal(isMersenne(x),y_correct))\r\n\r\n%%\r\nx = 157;\r\ny_correct = false;\r\nassert(isequal(isMersenne(x),y_correct))\r\n\r\n%%\r\nx = 2047;\r\ny_correct = false;\r\nassert(isequal(isMersenne(x),y_correct))\r\n\r\n%%\r\nx = 8191;\r\ny_correct = true;\r\nassert(isequal(isMersenne(x),y_correct))\r\n\r\n%%\r\nx = 524287;\r\ny_correct = true;\r\nassert(isequal(isMersenne(x),y_correct))\r\n\r\n%%\r\nx = 536870911;\r\ny_correct = false;\r\nassert(isequal(isMersenne(x),y_correct))\r\n","published":true,"deleted":false,"likes_count":7,"comments_count":4,"created_by":1537,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":968,"test_suite_updated_at":"2012-03-24T15:03:26.000Z","rescore_all_solutions":false,"group_id":44,"created_at":"2012-03-24T14:32:54.000Z","updated_at":"2026-02-15T11:05:47.000Z","published_at":"2012-03-24T14:36:27.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"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\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA Mersenne prime is a prime number of the form M = 2^p - 1, where p is another prime number. For example, 31 is a Mersenne prime because 31 = 2^5 - 1 and both 31 and 5 are prime numbers.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eImplement the function isMersenne(x) so that it returns true if x is a Mersenne prime and false otherwise. Your solution should work for all positive integer values of x less than 1,000,000,000 (one billion).\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":49860,"title":"Consecutive Prime Numbers","description":null,"description_html":"\u003cdiv style = \"text-align: start; line-height: 20.44px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: none solid rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 84px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 42px; transform-origin: 407px 42px; vertical-align: baseline; \"\u003e\u003cdiv style=\"font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 42px; text-align: left; transform-origin: 384px 42px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; \"\u003e\u003cspan style=\"\"\u003eThe closest consecutive prime numbers are 2 and 3 which only differ by 1. Other consecutive prime numbers will differ by an even number. For example, 3 and 5 as well as 5 and 7 differ by 2. Find an example of a pair of consecutive prime numbers for each of the required difference specify in the problem. There is no unique answer for each case; so, your answers will be checked against the requirement.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = prime_space(n)\r\n  y = [2 3];\r\nend","test_suite":"%%\r\nn=2;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=4;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=6;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=8;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=10;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=12;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=24;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=30;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=50;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n%%\r\nn=60;\r\ncc_answer=prime_space(n);\r\naa=primes(cc_answer(2));\r\nassert(all(isprime(cc_answer)))\r\nassert(cc_answer(2)-cc_answer(1)==n)\r\nassert(cc_answer(1)==aa(end-1))\r\n","published":true,"deleted":false,"likes_count":1,"comments_count":0,"created_by":180632,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":25,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2021-01-18T14:51:02.000Z","updated_at":"2026-03-03T22:04:29.000Z","published_at":"2021-01-18T14:51:02.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe closest consecutive prime numbers are 2 and 3 which only differ by 1. Other consecutive prime numbers will differ by an even number. For example, 3 and 5 as well as 5 and 7 differ by 2. Find an example of a pair of consecutive prime numbers for each of the required difference specify in the problem. There is no unique answer for each case; so, your answers will be checked against the requirement.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"},{"id":49855,"title":"Concatenated Consecutive Prime","description":null,"description_html":"\u003cdiv style = \"text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; \"\u003e\u003cdiv style=\"block-size: 63px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 31.5px; transform-origin: 407px 31.5px; vertical-align: baseline; \"\u003e\u003cdiv style=\"font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; \"\u003e\u003cspan style=\"block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 383.5px 8px; transform-origin: 383.5px 8px; unicode-bidi: normal; \"\u003e\u003cspan style=\"\"\u003eAs the name suggested, Concatenated Consecutive Prime is a prime number formed by concatenating consecutive prime numbers. For a given number of constituting primes (defined as \"n\"), please output a vector containing n consecutive primes that satisfy this problem. There is no unique answer, so your results will be evaluated against the requirements.\u003c/span\u003e\u003c/span\u003e\u003c/div\u003e\u003c/div\u003e\u003c/div\u003e","function_template":"function y = ccp(n)\r\n  y = [2 3 5 7 11 13 17 19];\r\nend","test_suite":"%%\r\nn=2;\r\ncc_answer=ccp(n);\r\nb=num2str(cc_answer(:));\r\ncombine=b(1,:);\r\nfor i=2:n\r\n   combine=strcat(combine,strtrim(b(i,:))); \r\nend\r\naa=primes(cc_answer(n));\r\nassert(isprime(str2num(combine)))\r\nfor i=1:n-1\r\n   assert(cc_answer(end-i)==aa(end-i))\r\nend\r\n\r\n%%\r\nn=3;\r\ncc_answer=ccp(n);\r\nb=num2str(cc_answer(:));\r\ncombine=b(1,:);\r\nfor i=2:n\r\n   combine=strcat(combine,strtrim(b(i,:))); \r\nend\r\naa=primes(cc_answer(n));\r\nassert(isprime(str2num(combine)))\r\nfor i=1:n-1\r\n   assert(cc_answer(end-i)==aa(end-i))\r\nend\r\n\r\n%%\r\nn=4;\r\ncc_answer=ccp(n);\r\nb=num2str(cc_answer(:));\r\ncombine=b(1,:);\r\nfor i=2:n\r\n   combine=strcat(combine,strtrim(b(i,:))); \r\nend\r\naa=primes(cc_answer(n));\r\nassert(isprime(str2num(combine)))\r\nfor i=1:n-1\r\n   assert(cc_answer(end-i)==aa(end-i))\r\nend\r\n\r\n%%\r\nn=5;\r\ncc_answer=ccp(n);\r\nb=num2str(cc_answer(:));\r\ncombine=b(1,:);\r\nfor i=2:n\r\n   combine=strcat(combine,strtrim(b(i,:))); \r\nend\r\naa=primes(cc_answer(n));\r\nassert(isprime(str2num(combine)))\r\nfor i=1:n-1\r\n   assert(cc_answer(end-i)==aa(end-i))\r\nend\r\n","published":true,"deleted":false,"likes_count":2,"comments_count":4,"created_by":180632,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":17,"test_suite_updated_at":"2021-01-19T11:29:35.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2021-01-17T23:20:39.000Z","updated_at":"2025-08-14T01:54:24.000Z","published_at":"2021-01-17T23:20:39.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAs the name suggested, Concatenated Consecutive Prime is a prime number formed by concatenating consecutive prime numbers. For a given number of constituting primes (defined as \\\"n\\\"), please output a vector containing n consecutive primes that satisfy this problem. There is no unique answer, so your results will be evaluated against the requirements.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\",\"relationship\":null}],\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"target\":\"/matlab/document.xml\",\"relationshipId\":\"rId1\"}]}"},{"id":525,"title":"Mersenne Primes","description":"A Mersenne prime is a prime number of the form M = 2^p - 1, where p is another prime number.  For example, 31 is a Mersenne prime because 31 = 2^5 - 1 and both 31 and 5 are prime numbers.\r\n\r\nImplement the function isMersenne(x) so that it returns true if x is a Mersenne prime and false otherwise.  Your solution should work for all positive integer values of x less than 1,000,000,000 (one billion).","description_html":"\u003cp\u003eA Mersenne prime is a prime number of the form M = 2^p - 1, where p is another prime number.  For example, 31 is a Mersenne prime because 31 = 2^5 - 1 and both 31 and 5 are prime numbers.\u003c/p\u003e\u003cp\u003eImplement the function isMersenne(x) so that it returns true if x is a Mersenne prime and false otherwise.  Your solution should work for all positive integer values of x less than 1,000,000,000 (one billion).\u003c/p\u003e","function_template":"function y = isMersenne(x)\r\n  y = false;\r\nend","test_suite":"%%\r\nx = 3;\r\ny_correct = true;\r\nassert(isequal(isMersenne(x),y_correct))\r\n\r\n%%\r\nx = 127;\r\ny_correct = true;\r\nassert(isequal(isMersenne(x),y_correct))\r\n\r\n%%\r\nx = 157;\r\ny_correct = false;\r\nassert(isequal(isMersenne(x),y_correct))\r\n\r\n%%\r\nx = 2047;\r\ny_correct = false;\r\nassert(isequal(isMersenne(x),y_correct))\r\n\r\n%%\r\nx = 8191;\r\ny_correct = true;\r\nassert(isequal(isMersenne(x),y_correct))\r\n\r\n%%\r\nx = 524287;\r\ny_correct = true;\r\nassert(isequal(isMersenne(x),y_correct))\r\n\r\n%%\r\nx = 536870911;\r\ny_correct = false;\r\nassert(isequal(isMersenne(x),y_correct))\r\n","published":true,"deleted":false,"likes_count":7,"comments_count":4,"created_by":1537,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":968,"test_suite_updated_at":"2012-03-24T15:03:26.000Z","rescore_all_solutions":false,"group_id":44,"created_at":"2012-03-24T14:32:54.000Z","updated_at":"2026-02-15T11:05:47.000Z","published_at":"2012-03-24T14:36:27.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"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\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA Mersenne prime is a prime number of the form M = 2^p - 1, where p is another prime number. For example, 31 is a Mersenne prime because 31 = 2^5 - 1 and both 31 and 5 are prime numbers.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eImplement the function isMersenne(x) so that it returns true if x is a Mersenne prime and false otherwise. Your solution should work for all positive integer values of x less than 1,000,000,000 (one billion).\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"term":"tag:\"prime number\"","current_player_id":null,"fields":[{"name":"page","type":"integer","callback":null,"default":1,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"per_page","type":"integer","callback":null,"default":50,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"sort","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"body","type":"text","callback":null,"default":"*:*","directive":null,"facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":false},{"name":"group","type":"string","callback":null,"default":null,"directive":"group","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"difficulty_rating_bin","type":"string","callback":null,"default":null,"directive":"difficulty_rating_bin","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"id","type":"integer","callback":null,"default":null,"directive":"id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"tag","type":"string","callback":null,"default":null,"directive":"tag","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"product","type":"string","callback":null,"default":null,"directive":"product","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_at","type":"timeframe","callback":{},"default":null,"directive":"created_at","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"profile_id","type":"integer","callback":null,"default":null,"directive":"author_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_by","type":"string","callback":null,"default":null,"directive":"author","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player_id","type":"integer","callback":null,"default":null,"directive":"solver_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player","type":"string","callback":null,"default":null,"directive":"solver","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"solvers_count","type":"integer","callback":null,"default":null,"directive":"solvers_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"comments_count","type":"integer","callback":null,"default":null,"directive":"comments_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"likes_count","type":"integer","callback":null,"default":null,"directive":"likes_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leader_id","type":"integer","callback":null,"default":null,"directive":"leader_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leading_solution","type":"integer","callback":null,"default":null,"directive":"leading_solution","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true}],"filters":[{"name":"asset_type","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":"\"cody:problem\"","prepend":true},{"name":"profile_id","type":"integer","callback":{},"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":"author_id","static":null,"prepend":true}],"query":{"params":{"per_page":50,"term":"tag:\"prime number\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"prime number\"","","\"","prime number","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f1960387450\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f19603873b0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f19603869b0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f19603876d0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f1960387630\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f1960387590\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f19603874f0\u003e":"tag:\"prime number\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f19603874f0\u003e":"tag:\"prime number\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"search","password":"J3bGPZzQ7asjJcCk","virtual_host":"search","indexer":"amqp","http_logging":"true","core":"cody"},"query_connection":{"uri":"http://search-op-v2/solr/cody/","proxy":null,"connection":{"parallel_manager":null,"headers":{"User-Agent":"Faraday v1.0.1"},"params":{},"options":{"params_encoder":"Faraday::FlatParamsEncoder","proxy":null,"bind":null,"timeout":null,"open_timeout":null,"read_timeout":null,"write_timeout":null,"boundary":null,"oauth":null,"context":null,"on_data":null},"ssl":{"verify":true,"ca_file":null,"ca_path":null,"verify_mode":null,"cert_store":null,"client_cert":null,"client_key":null,"certificate":null,"private_key":null,"verify_depth":null,"version":null,"min_version":null,"max_version":null},"default_parallel_manager":null,"builder":{"adapter":{"name":"Faraday::Adapter::NetHttp","args":[],"block":null},"handlers":[{"name":"Faraday::Response::RaiseError","args":[],"block":null}],"app":{"app":{"ssl_cert_store":{"verify_callback":null,"error":null,"error_string":null,"chain":null,"time":null},"app":{},"connection_options":{},"config_block":null}}},"url_prefix":"http://search-op-v2/solr/cody/","manual_proxy":false,"proxy":null},"update_format":"RSolr::JSON::Generator","update_path":"update","options":{"url":"http://search-op-v2/solr/cody"}}},"query":{"params":{"per_page":50,"term":"tag:\"prime number\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"prime number\"","","\"","prime number","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f1960387450\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f19603873b0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f19603869b0\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f19603876d0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f1960387630\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f1960387590\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f19603874f0\u003e":"tag:\"prime number\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f19603874f0\u003e":"tag:\"prime number\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":49860,"difficulty_rating":"easy"},{"id":49855,"difficulty_rating":"easy-medium"},{"id":525,"difficulty_rating":"medium"}]}}