tag:blogger.com,1999:blog-921491940328660144.post4744052433384193295..comments2023-09-21T08:31:41.915-07:00Comments on C++ Codes: Check If A Number Is A Prime Number Vinsterhttp://www.blogger.com/profile/00316054785887321051noreply@blogger.comBlogger5125tag:blogger.com,1999:blog-921491940328660144.post-91798505874256811212019-10-14T11:31:57.486-07:002019-10-14T11:31:57.486-07:00..Daniel Pawskihttps://www.blogger.com/profile/13261359477200680959noreply@blogger.comtag:blogger.com,1999:blog-921491940328660144.post-58114481030062308592019-03-21T07:09:42.063-07:002019-03-21T07:09:42.063-07:00Nice collection; to add on : some c++ tips and tri...<br />Nice collection; to add on : some c++ tips and tricks.<br /><a href="https://www.welookups.com/C++/default.html" rel="nofollow">welookups C++</a><br /><a href="https://www.javacodegeeks.net/" rel="nofollow">javacodegeeks</a> sumanhttps://www.blogger.com/profile/02683678626796708367noreply@blogger.comtag:blogger.com,1999:blog-921491940328660144.post-71156409140324651662017-07-13T06:15:54.474-07:002017-07-13T06:15:54.474-07:00Get various ways to finds the prime numbers with n...Get various ways to finds the <a href="http://nuclearstrategy.co.uk/prime-number-distribution-series" rel="nofollow">prime numbers</a> with new methods such as mathematical formula , c++ , c etc . You can also download materials to know more about prime numbers.Anonymoushttps://www.blogger.com/profile/07009007828060154633noreply@blogger.comtag:blogger.com,1999:blog-921491940328660144.post-89432955696784272062013-12-09T15:13:31.944-08:002013-12-09T15:13:31.944-08:00Hi Patryk, thanks for you comment. I really apprec...Hi Patryk, thanks for you comment. I really appreciate it and will take a look at your solution and then share to others.<br /><br />Thanks a lot!Vinsterhttps://www.blogger.com/profile/00316054785887321051noreply@blogger.comtag:blogger.com,1999:blog-921491940328660144.post-82297635646944373412013-11-21T00:40:42.587-08:002013-11-21T00:40:42.587-08:00Nice solution, but your one optimization does not ...Nice solution, but your one optimization does not do anything. i is of course smaller than number, that is what you check in your for loop. The first optimization step should be, that i only goes up until half of number, e. g. i <= (number/2). Because any i bigger than that would have to be multiplied by a factor smaller than 2 to get to number. Anonymoushttps://www.blogger.com/profile/04396094641703881652noreply@blogger.com