{"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":2499,"title":"Airline Ticket Mod7 Checksum ","description":"There are 13 digits in an airline ticket number. If an airline ticket number is valid, the 13th digit should be the remainder of division by seven of the first 12. \r\n\r\n\r\n\r\nWrite a function that returns true if a plane ticket number is valid and false otherwise.","description_html":"\u003cp\u003eThere are 13 digits in an airline ticket number. If an airline ticket number is valid, the 13th digit should be the remainder of division by seven of the first 12.\u003c/p\u003e\u003cp\u003eWrite a function that returns true if a plane ticket number is valid and false otherwise.\u003c/p\u003e","function_template":"function b = isTicketValid(T)\r\n\r\nend","test_suite":"%%\r\nT=1234567891011;\r\nb_correct=0;\r\nassert(isequal(isTicketValid(T),b_correct))\r\n%%\r\nT=2355211846932;\r\nb_correct=0;\r\nassert(isequal(isTicketValid(T),b_correct))\r\n%%\r\nT=2355211846934;\r\nb_correct=1;\r\nassert(isequal(isTicketValid(T),b_correct))\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":0,"created_by":379,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":86,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2014-08-09T16:26:01.000Z","updated_at":"2026-04-03T02:48:52.000Z","published_at":"2014-08-09T16:26:01.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\u003eThere are 13 digits in an airline ticket number. If an airline ticket number is valid, the 13th digit should be the remainder of division by seven of the first 12.\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\u003eWrite a function that returns true if a plane ticket number is valid and false otherwise.\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\"}]}"},{"id":45490,"title":"Luhn's Algorithm","description":"Luhn's Algorithm is used as a checksum for credit card numbers or similar identifiers. It can detect single-digit changes and swapped digits. It consists of four steps:\r\n\r\n# Double every second digit (starting with the last one).\r\n# If a digit exceeds 9 due to the doubling, subtract 9.\r\n# Add all the digits.\r\n# Append the last digit of the sum to the original number. \r\n\r\nMore information can be found on \u003chttps://en.wikipedia.org/wiki/Luhn_algorithm\u003e or in ISO/IEC 7812-1. \r\n\r\nYour function takes the original numbers as a character vector, and it has to return a character vector that includes the checksum. \r\n","description_html":"\u003cp\u003eLuhn's Algorithm is used as a checksum for credit card numbers or similar identifiers. It can detect single-digit changes and swapped digits. It consists of four steps:\u003c/p\u003e\u003col\u003e\u003cli\u003eDouble every second digit (starting with the last one).\u003c/li\u003e\u003cli\u003eIf a digit exceeds 9 due to the doubling, subtract 9.\u003c/li\u003e\u003cli\u003eAdd all the digits.\u003c/li\u003e\u003cli\u003eAppend the last digit of the sum to the original number.\u003c/li\u003e\u003c/ol\u003e\u003cp\u003eMore information can be found on \u003ca href = \"https://en.wikipedia.org/wiki/Luhn_algorithm\"\u003ehttps://en.wikipedia.org/wiki/Luhn_algorithm\u003c/a\u003e or in ISO/IEC 7812-1.\u003c/p\u003e\u003cp\u003eYour function takes the original numbers as a character vector, and it has to return a character vector that includes the checksum.\u003c/p\u003e","function_template":"function y = luhn(x)\r\n  n = x;\r\n  % add your checksum algorithm here to replace c\r\n  c = '0';\r\n\r\n  y = [x c];\r\nend","test_suite":"%%\r\nx = '0';\r\nassert(isequal(luhn(x),'00'));\r\n%%\r\nx = '1';\r\nassert(isequal(luhn(x),'12'));\r\n%%\r\nx = '5';\r\nassert(isequal(luhn(x),'51'));\r\n%%\r\nx = '9';\r\nassert(isequal(luhn(x),'99'));\r\n%%\r\nx = '10';\r\nassert(isequal(luhn(x),'101'));\r\n%%\r\nx = '80';\r\nassert(isequal(luhn(x),'808'));\r\n%%\r\nx = '080';\r\nassert(isequal(luhn(x),'0808'));\r\n%%\r\nx = '180';\r\nassert(isequal(luhn(x),'1800'));\r\n%%\r\nx = '1234567890';\r\nassert(isequal(luhn(x),'12345678907'));\r\n\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":160977,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":22,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2020-05-01T10:49:57.000Z","updated_at":"2026-01-20T13:11:19.000Z","published_at":"2020-05-01T10:50:46.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\",\"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\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\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\u003eLuhn's Algorithm is used as a checksum for credit card numbers or similar identifiers. It can detect single-digit changes and swapped digits. It consists of four steps:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"2\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eDouble every second digit (starting with the last one).\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"2\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eIf a digit exceeds 9 due to the doubling, subtract 9.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"2\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAdd all the digits.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"2\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAppend the last digit of the sum to the original number.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eMore information can be found on\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://en.wikipedia.org/wiki/Luhn_algorithm\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026lt;https://en.wikipedia.org/wiki/Luhn_algorithm\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026gt; or in ISO/IEC 7812-1.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYour function takes the original numbers as a character vector, and it has to return a character vector that includes the checksum.\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":2499,"title":"Airline Ticket Mod7 Checksum ","description":"There are 13 digits in an airline ticket number. If an airline ticket number is valid, the 13th digit should be the remainder of division by seven of the first 12. \r\n\r\n\r\n\r\nWrite a function that returns true if a plane ticket number is valid and false otherwise.","description_html":"\u003cp\u003eThere are 13 digits in an airline ticket number. If an airline ticket number is valid, the 13th digit should be the remainder of division by seven of the first 12.\u003c/p\u003e\u003cp\u003eWrite a function that returns true if a plane ticket number is valid and false otherwise.\u003c/p\u003e","function_template":"function b = isTicketValid(T)\r\n\r\nend","test_suite":"%%\r\nT=1234567891011;\r\nb_correct=0;\r\nassert(isequal(isTicketValid(T),b_correct))\r\n%%\r\nT=2355211846932;\r\nb_correct=0;\r\nassert(isequal(isTicketValid(T),b_correct))\r\n%%\r\nT=2355211846934;\r\nb_correct=1;\r\nassert(isequal(isTicketValid(T),b_correct))\r\n","published":true,"deleted":false,"likes_count":3,"comments_count":0,"created_by":379,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":86,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2014-08-09T16:26:01.000Z","updated_at":"2026-04-03T02:48:52.000Z","published_at":"2014-08-09T16:26:01.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\u003eThere are 13 digits in an airline ticket number. If an airline ticket number is valid, the 13th digit should be the remainder of division by seven of the first 12.\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\u003eWrite a function that returns true if a plane ticket number is valid and false otherwise.\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\"}]}"},{"id":45490,"title":"Luhn's Algorithm","description":"Luhn's Algorithm is used as a checksum for credit card numbers or similar identifiers. It can detect single-digit changes and swapped digits. It consists of four steps:\r\n\r\n# Double every second digit (starting with the last one).\r\n# If a digit exceeds 9 due to the doubling, subtract 9.\r\n# Add all the digits.\r\n# Append the last digit of the sum to the original number. \r\n\r\nMore information can be found on \u003chttps://en.wikipedia.org/wiki/Luhn_algorithm\u003e or in ISO/IEC 7812-1. \r\n\r\nYour function takes the original numbers as a character vector, and it has to return a character vector that includes the checksum. \r\n","description_html":"\u003cp\u003eLuhn's Algorithm is used as a checksum for credit card numbers or similar identifiers. It can detect single-digit changes and swapped digits. It consists of four steps:\u003c/p\u003e\u003col\u003e\u003cli\u003eDouble every second digit (starting with the last one).\u003c/li\u003e\u003cli\u003eIf a digit exceeds 9 due to the doubling, subtract 9.\u003c/li\u003e\u003cli\u003eAdd all the digits.\u003c/li\u003e\u003cli\u003eAppend the last digit of the sum to the original number.\u003c/li\u003e\u003c/ol\u003e\u003cp\u003eMore information can be found on \u003ca href = \"https://en.wikipedia.org/wiki/Luhn_algorithm\"\u003ehttps://en.wikipedia.org/wiki/Luhn_algorithm\u003c/a\u003e or in ISO/IEC 7812-1.\u003c/p\u003e\u003cp\u003eYour function takes the original numbers as a character vector, and it has to return a character vector that includes the checksum.\u003c/p\u003e","function_template":"function y = luhn(x)\r\n  n = x;\r\n  % add your checksum algorithm here to replace c\r\n  c = '0';\r\n\r\n  y = [x c];\r\nend","test_suite":"%%\r\nx = '0';\r\nassert(isequal(luhn(x),'00'));\r\n%%\r\nx = '1';\r\nassert(isequal(luhn(x),'12'));\r\n%%\r\nx = '5';\r\nassert(isequal(luhn(x),'51'));\r\n%%\r\nx = '9';\r\nassert(isequal(luhn(x),'99'));\r\n%%\r\nx = '10';\r\nassert(isequal(luhn(x),'101'));\r\n%%\r\nx = '80';\r\nassert(isequal(luhn(x),'808'));\r\n%%\r\nx = '080';\r\nassert(isequal(luhn(x),'0808'));\r\n%%\r\nx = '180';\r\nassert(isequal(luhn(x),'1800'));\r\n%%\r\nx = '1234567890';\r\nassert(isequal(luhn(x),'12345678907'));\r\n\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":160977,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":22,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2020-05-01T10:49:57.000Z","updated_at":"2026-01-20T13:11:19.000Z","published_at":"2020-05-01T10:50:46.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\",\"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\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\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\u003eLuhn's Algorithm is used as a checksum for credit card numbers or similar identifiers. It can detect single-digit changes and swapped digits. It consists of four steps:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"2\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eDouble every second digit (starting with the last one).\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"2\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eIf a digit exceeds 9 due to the doubling, subtract 9.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"2\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAdd all the digits.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"2\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eAppend the last digit of the sum to the original number.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eMore information can be found on\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://en.wikipedia.org/wiki/Luhn_algorithm\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026lt;https://en.wikipedia.org/wiki/Luhn_algorithm\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026gt; or in ISO/IEC 7812-1.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eYour function takes the original numbers as a character vector, and it has to return a character vector that includes the checksum.\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:\"checksum\"","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:\"checksum\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"checksum\"","","\"","checksum","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007fac45d42580\u003e":null,"#\u003cMathWorks::Search::Field:0x00007fac45d424e0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007fac45d41c20\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007fac45d428a0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007fac45d42800\u003e":50,"#\u003cMathWorks::Search::Field:0x00007fac45d426c0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007fac45d42620\u003e":"tag:\"checksum\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007fac45d42620\u003e":"tag:\"checksum\""},"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:\"checksum\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"checksum\"","","\"","checksum","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007fac45d42580\u003e":null,"#\u003cMathWorks::Search::Field:0x00007fac45d424e0\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007fac45d41c20\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007fac45d428a0\u003e":1,"#\u003cMathWorks::Search::Field:0x00007fac45d42800\u003e":50,"#\u003cMathWorks::Search::Field:0x00007fac45d426c0\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007fac45d42620\u003e":"tag:\"checksum\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007fac45d42620\u003e":"tag:\"checksum\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":2499,"difficulty_rating":"easy"},{"id":45490,"difficulty_rating":"easy-medium"}]}}