尋找最大質數副本 | JavaScript 程式專案

{"id":40799,"student_id":139,"content":"setBackdrop(\"black\");\nvar count = 1\nforever(function(){\ncount++\nif(isPrime(count)){\n    print(count, 150, 200,'white',150)\n   \n\n}\n\n\n    \n\n})\n\nfunction isPrime(number){\n    for (var i=0; i\u003cnumber; i++) {\n        if(count%i==0){\n            return false\n        }\n            \n        }\n    return true\n    \n}\nisPrime(10)\n\n\nfunction check(num){\n    var up = Math.sprt(num);\n    for(var i=2; i\u003c up;i++){\n        if(num%i==0){\n            return false; \n        }\n    }\n    return true\n    \n    \n    \n    \n}\n\n\n\n\n","created_at":"2018-09-01T16:13:00.401+08:00","updated_at":"2019-06-17T09:11:36.662+08:00","name":"尋找最大質數 副本","language":"javascript","screenshot":{"url":"https://cdn8.koding.school/uploads/project/screenshot/40799/0916e9d16cf9c060b8ddcd674c4a4d86.jpg"},"parent_id":32559,"plugin":"","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":109,"hashid":"d5ms928r","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}