{"id":622707,"date":"2023-06-20T22:01:17","date_gmt":"2023-06-20T16:31:17","guid":{"rendered":"https:\/\/infinitylearn.com\/surge\/?p=622707"},"modified":"2025-02-28T17:14:59","modified_gmt":"2025-02-28T11:44:59","slug":"prime-number-formula","status":"publish","type":"post","link":"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/","title":{"rendered":"Prime Number Formula\u00a0"},"content":{"rendered":"<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_37 counter-hierarchy ez-toc-counter ez-toc-grey ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title\">Table of Contents<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" style=\"display: none;\"><label for=\"item\" aria-label=\"Table of Content\"><span style=\"display: flex;align-items: center;width: 35px;height: 30px;justify-content: center;\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/label><input type=\"checkbox\" id=\"item\"><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1' style='display:block'><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/#Introduction\" title=\"Introduction:\">Introduction:<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/#Definition_of_Prime_Number\" title=\"Definition of Prime Number:\">Definition of Prime Number:<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/#Prime_Number_Formula\" title=\"Prime Number Formula\">Prime Number Formula<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/#Applications_of_Prime_Number_Formula\" title=\"Applications of Prime Number Formula:\">Applications of Prime Number Formula:<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/#Solved_Examples_on_Prime_Number_Formula\" title=\"Solved Examples on Prime Number Formula:\">Solved Examples on Prime Number Formula:<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/#Frequently_Asked_Questions_on_Prime_Number_Formula\" title=\"Frequently Asked Questions on Prime Number Formula:\">Frequently Asked Questions on Prime Number Formula:<\/a><\/li><\/ul><\/nav><\/div>\n<h2><span class=\"ez-toc-section\" id=\"Introduction\"><\/span>Introduction:<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>Prime numbers are a fundamental concept in number theory. They are positive integers greater than 1 that have no divisors other than 1 and themselves. Prime numbers are the fundamental building blocks of natural numbers and play a significant role in number theory and various mathematical applications.<\/p>\n<p>&nbsp;<\/p>\n<h2><span class=\"ez-toc-section\" id=\"Definition_of_Prime_Number\"><\/span>Definition of Prime Number:<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>A prime number is a positive integer greater than 1 that has no divisors other than 1 and itself. In other words, it cannot be divided evenly by any other positive integer except 1 and the number itself.<\/p>\n<p>For example, 2, 3, 5, 7, 11, 13, and 17 are all prime numbers.<\/p>\n<p>&nbsp;<\/p>\n<h2><span class=\"ez-toc-section\" id=\"Prime_Number_Formula\"><\/span>Prime Number Formula<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>There are several formulas and methods to test whether a number is prime or not, as well as to generate prime numbers. Here are a few commonly used ones:<\/p>\n<ol>\n<li>Trial Division: This is the most basic method to test if a number is prime. It involves dividing the number by all the integers from 2 to the square root of the number. If none of these divisions yield a remainder of 0, then the number is prime.<\/li>\n<li>Sieve of Eratosthenes: This is an ancient algorithm used to generate prime numbers up to a given limit. The algorithm starts with a list of all numbers from 2 to the desired limit. It repeatedly finds the smallest remaining number in the list (starting with 2), and removes all its multiples from the list. The remaining numbers in the list are prime.<\/li>\n<li>Wilson&#8217;s Theorem: Wilson&#8217;s theorem provides a condition to test whether a number is prime or not. According to the theorem, for a positive integer n, (n-1)! + 1 is divisible by n if and only if n is prime.<\/li>\n<li>Fermat&#8217;s Little Theorem: Fermat&#8217;s Little Theorem states that if p is a prime number and a is any positive integer not divisible by p, then a raised to the power of p-1 is congruent to 1 modulo p. This theorem can be used as a primality test for numbers, known as the Fermat primality test.<\/li>\n<li>AKS Primality Test: The AKS primality test is a deterministic algorithm developed by Agrawal, Kayal, and Saxena. It determines whether a given number is prime or composite in polynomial time.<\/li>\n<li>Prime Number Generating Formula: Some formulas can generate prime numbers directly. For example, the formula n2 + n + 41 generates prime numbers for consecutive values of n starting from 0.<\/li>\n<\/ol>\n<p>These formulas and methods provide different approaches to test for primality and generate prime numbers. They have varying levels of complexity, efficiency, and applicability depending on the specific requirements and constraints of the problem at hand.<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<h2><span class=\"ez-toc-section\" id=\"Applications_of_Prime_Number_Formula\"><\/span>Applications of Prime Number Formula:<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>Prime numbers have numerous applications in various fields, including:<\/p>\n<ul>\n<li data-leveltext=\"\uf0b7\" data-font=\"Symbol\" data-listid=\"2\" data-list-defn-props=\"{&quot;335552541&quot;:1,&quot;335559684&quot;:-2,&quot;335559685&quot;:720,&quot;335559991&quot;:360,&quot;469769226&quot;:&quot;Symbol&quot;,&quot;469769242&quot;:[8226],&quot;469777803&quot;:&quot;left&quot;,&quot;469777804&quot;:&quot;\uf0b7&quot;,&quot;469777815&quot;:&quot;hybridMultilevel&quot;}\" aria-setsize=\"-1\" data-aria-posinset=\"1\" data-aria-level=\"1\">Cryptography: Prime numbers are extensively used in encryption algorithms, such as the RSA (Rivest-Shamir-Adleman) algorithm. The security of these algorithms relies on the difficulty of factoring large composite numbers into their prime factors.<\/li>\n<li data-leveltext=\"\uf0b7\" data-font=\"Symbol\" data-listid=\"2\" data-list-defn-props=\"{&quot;335552541&quot;:1,&quot;335559684&quot;:-2,&quot;335559685&quot;:720,&quot;335559991&quot;:360,&quot;469769226&quot;:&quot;Symbol&quot;,&quot;469769242&quot;:[8226],&quot;469777803&quot;:&quot;left&quot;,&quot;469777804&quot;:&quot;\uf0b7&quot;,&quot;469777815&quot;:&quot;hybridMultilevel&quot;}\" aria-setsize=\"-1\" data-aria-posinset=\"2\" data-aria-level=\"1\">Generating Random Numbers: Prime numbers are often used in generating random numbers with high security and unpredictability. They are crucial in applications such as computer simulations, cryptography, and statistical analysis.<\/li>\n<li data-leveltext=\"\uf0b7\" data-font=\"Symbol\" data-listid=\"2\" data-list-defn-props=\"{&quot;335552541&quot;:1,&quot;335559684&quot;:-2,&quot;335559685&quot;:720,&quot;335559991&quot;:360,&quot;469769226&quot;:&quot;Symbol&quot;,&quot;469769242&quot;:[8226],&quot;469777803&quot;:&quot;left&quot;,&quot;469777804&quot;:&quot;\uf0b7&quot;,&quot;469777815&quot;:&quot;hybridMultilevel&quot;}\" aria-setsize=\"-1\" data-aria-posinset=\"3\" data-aria-level=\"1\">Factorization: Prime numbers are used in the factorization of large numbers into their prime factors. This has applications in number theory, integer factorization algorithms, and solving mathematical problems.<\/li>\n<\/ul>\n<ul>\n<li data-leveltext=\"\uf0b7\" data-font=\"Symbol\" data-listid=\"2\" data-list-defn-props=\"{&quot;335552541&quot;:1,&quot;335559684&quot;:-2,&quot;335559685&quot;:720,&quot;335559991&quot;:360,&quot;469769226&quot;:&quot;Symbol&quot;,&quot;469769242&quot;:[8226],&quot;469777803&quot;:&quot;left&quot;,&quot;469777804&quot;:&quot;\uf0b7&quot;,&quot;469777815&quot;:&quot;hybridMultilevel&quot;}\" aria-setsize=\"-1\" data-aria-posinset=\"1\" data-aria-level=\"1\">Number Theory: Prime numbers are the building blocks of number theory. They form the basis for many theorems and concepts, such as the Fundamental Theorem of Arithmetic, Euler&#8217;s totient function, and the Goldbach Conjecture.<\/li>\n<li data-leveltext=\"\uf0b7\" data-font=\"Symbol\" data-listid=\"2\" data-list-defn-props=\"{&quot;335552541&quot;:1,&quot;335559684&quot;:-2,&quot;335559685&quot;:720,&quot;335559991&quot;:360,&quot;469769226&quot;:&quot;Symbol&quot;,&quot;469769242&quot;:[8226],&quot;469777803&quot;:&quot;left&quot;,&quot;469777804&quot;:&quot;\uf0b7&quot;,&quot;469777815&quot;:&quot;hybridMultilevel&quot;}\" aria-setsize=\"-1\" data-aria-posinset=\"2\" data-aria-level=\"1\">Prime Number Distribution: The study of prime numbers also involves analyzing their distribution and understanding the patterns within the sequence of primes. This has led to the development of various conjectures and theorems in prime number theory.<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<h2><span class=\"ez-toc-section\" id=\"Solved_Examples_on_Prime_Number_Formula\"><\/span>Solved Examples on Prime Number Formula:<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>Example 1: Test if (n+1) is prime by checking if n! \u2261 n (mod n+1).<\/p>\n<p>&nbsp;<\/p>\n<p>Let&#8217;s take n = 4. 4! = 4 \u00d7 3 \u00d7 2 \u00d7 1 = 24. 24 \u2261 4 (mod 5).<\/p>\n<p>Since 4! \u2261 4 (mod 5), we can conclude that (n+1) = 5 is a prime number.<\/p>\n<p>&nbsp;<\/p>\n<p>Example 2: Generate prime numbers of the form 6n \u00b1 1.<\/p>\n<p>&nbsp;<\/p>\n<p>Let&#8217;s find the prime numbers between 10 and 20 using this formula:<\/p>\n<p>For n = 2, 6n &#8211; 1 = 11, which is prime.<\/p>\n<p>For n = 3, 6n &#8211; 1 = 17, which is prime.<\/p>\n<p>For n = 4, 6n + 1 = 25, which is not prime.<\/p>\n<p>For n = 5, 6n &#8211; 1 = 29, which is prime.<\/p>\n<p>Therefore, the prime numbers between 10 and 20 generated  are 11, 17, and 29.<\/p>\n<p>&nbsp;<\/p>\n<p>Example 3: Generate prime numbers greater than 40 using n2+ n + 41.<\/p>\n<p>Let&#8217;s find the prime numbers generated by this formula for n = 0 to 5:<\/p>\n<p>For n = 0, n2 + n + 41 = 41, which is prime.<\/p>\n<p>For n = 1, n2 + n + 41 = 43, which is prime.<\/p>\n<p>For n = 2, n2 + n + 41 = 47, which is prime.<\/p>\n<p>For n = 3, n2 + n + 41 = 53, which is prime.<\/p>\n<p>For n = 4, n2 + n + 41 = 61, which is prime.<\/p>\n<p>For n = 5, n2 + n + 41 = 71, which is prime.<\/p>\n<p>Therefore, the prime numbers generated for n = 0 to 5 are 41, 43, 47, 53, 61, and 71.<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<h2><span class=\"ez-toc-section\" id=\"Frequently_Asked_Questions_on_Prime_Number_Formula\"><\/span>Frequently Asked Questions on Prime Number Formula:<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>1: What is the logic of a prime number?<br \/>\nAnswer: The logic of a prime number is that it is a natural number greater than 1 that has no positive divisors other than 1 and itself. In other words, it cannot be evenly divided by any other number except for 1 and the number itself.<\/p>\n<p>&nbsp;<\/p>\n<p>2: What is the formula to find prime number between 1 to 100?<\/p>\n<p>Answer: To find prime numbers between 1 and 100, you can use various methods such as the Sieve of Eratosthenes or trial division. One simple formula to find prime numbers in this range is to iterate through each number and test if it is divisible by any number from 2 to the square root of the number. If it is not divisible by any of these numbers, then it is a prime number..<\/p>\n<p>&nbsp;<\/p>\n<p>3: What is the easiest way to find prime numbers?<\/p>\n<p>Answer: The easiest way to find prime numbers depends on the context and the range of numbers you are working with. For small numbers, you can use manual methods like trial division. For larger numbers, more efficient algorithms like the Sieve of Eratosthenes or primality testing algorithms can be used.<\/p>\n<p>&nbsp;<\/p>\n<p>4: Why is 2 a prime number?<\/p>\n<p>Answer: The number 2 is a prime number because it is only divisible by 1 and itself, satisfying the definition of a prime number. It is the only even prime number.<\/p>\n<p>&nbsp;<\/p>\n<p>5: Are all odd numbers prime?<\/p>\n<p>Answer: Not all odd numbers are prime. For example, 9 is an odd number but not a prime number because it is divisible by 3.<\/p>\n<p>&nbsp;<\/p>\n<p>6: Why is 1 not a prime number?<\/p>\n<p>Answer: The number 1 is not considered a prime number because it does not meet the definition of a prime number. By definition, prime numbers must have exactly two distinct positive divisors, but 1 only has one positive divisor, which is 1 itself.<\/p>\n<p>&nbsp;<\/p>\n<p>7: Is 7 a prime number?<\/p>\n<p>Answer: Yes, 7 is a prime number because it is only divisible by 1 and 7 without any remainder.<\/p>\n<p>&nbsp;<\/p>\n<p>8: What is the smallest prime number?<\/p>\n<p>Answer: The smallest prime number is 2. It is the only even prime number, and all other prime numbers are odd.<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Introduction: Prime numbers are a fundamental concept in number theory. They are positive integers greater than 1 that have no [&hellip;]<\/p>\n","protected":false},"author":53,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_yoast_wpseo_focuskw":"Prime Number Formula\u00a0","_yoast_wpseo_title":"Prime Number Formula\u00a0with Example - Infinity learn","_yoast_wpseo_metadesc":"Explore the methods to identify prime numbers. Perfect guide for math students and anyone interested in number theory.","custom_permalink":"formulas\/prime-number-formula\/"},"categories":[8438,8536],"tags":[],"table_tags":[],"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v17.9 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Prime Number Formula\u00a0with Example - Infinity learn<\/title>\n<meta name=\"description\" content=\"Explore the methods to identify prime numbers. Perfect guide for math students and anyone interested in number theory.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Prime Number Formula\u00a0with Example - Infinity learn\" \/>\n<meta property=\"og:description\" content=\"Explore the methods to identify prime numbers. Perfect guide for math students and anyone interested in number theory.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/\" \/>\n<meta property=\"og:site_name\" content=\"Infinity Learn by Sri Chaitanya\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/InfinityLearn.SriChaitanya\/\" \/>\n<meta property=\"article:published_time\" content=\"2023-06-20T16:31:17+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-02-28T11:44:59+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2025\/04\/infinitylearn.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"1920\" \/>\n\t<meta property=\"og:image:height\" content=\"1008\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@InfinityLearn_\" \/>\n<meta name=\"twitter:site\" content=\"@InfinityLearn_\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Ankit\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"6 minutes\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Prime Number Formula\u00a0with Example - Infinity learn","description":"Explore the methods to identify prime numbers. Perfect guide for math students and anyone interested in number theory.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/","og_locale":"en_US","og_type":"article","og_title":"Prime Number Formula\u00a0with Example - Infinity learn","og_description":"Explore the methods to identify prime numbers. Perfect guide for math students and anyone interested in number theory.","og_url":"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/","og_site_name":"Infinity Learn by Sri Chaitanya","article_publisher":"https:\/\/www.facebook.com\/InfinityLearn.SriChaitanya\/","article_published_time":"2023-06-20T16:31:17+00:00","article_modified_time":"2025-02-28T11:44:59+00:00","og_image":[{"width":1920,"height":1008,"url":"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2025\/04\/infinitylearn.jpg","type":"image\/jpeg"}],"twitter_card":"summary_large_image","twitter_creator":"@InfinityLearn_","twitter_site":"@InfinityLearn_","twitter_misc":{"Written by":"Ankit","Est. reading time":"6 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Organization","@id":"https:\/\/infinitylearn.com\/surge\/#organization","name":"Infinity Learn","url":"https:\/\/infinitylearn.com\/surge\/","sameAs":["https:\/\/www.facebook.com\/InfinityLearn.SriChaitanya\/","https:\/\/www.instagram.com\/infinitylearn_by_srichaitanya\/","https:\/\/www.linkedin.com\/company\/infinity-learn-by-sri-chaitanya\/","https:\/\/www.youtube.com\/c\/InfinityLearnEdu","https:\/\/twitter.com\/InfinityLearn_"],"logo":{"@type":"ImageObject","@id":"https:\/\/infinitylearn.com\/surge\/#logo","inLanguage":"en-US","url":"","contentUrl":"","caption":"Infinity Learn"},"image":{"@id":"https:\/\/infinitylearn.com\/surge\/#logo"}},{"@type":"WebSite","@id":"https:\/\/infinitylearn.com\/surge\/#website","url":"https:\/\/infinitylearn.com\/surge\/","name":"Infinity Learn by Sri Chaitanya","description":"Surge","publisher":{"@id":"https:\/\/infinitylearn.com\/surge\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/infinitylearn.com\/surge\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/#webpage","url":"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/","name":"Prime Number Formula\u00a0with Example - Infinity learn","isPartOf":{"@id":"https:\/\/infinitylearn.com\/surge\/#website"},"datePublished":"2023-06-20T16:31:17+00:00","dateModified":"2025-02-28T11:44:59+00:00","description":"Explore the methods to identify prime numbers. Perfect guide for math students and anyone interested in number theory.","breadcrumb":{"@id":"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/infinitylearn.com\/surge\/"},{"@type":"ListItem","position":2,"name":"Prime Number Formula\u00a0"}]},{"@type":"Article","@id":"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/#article","isPartOf":{"@id":"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/#webpage"},"author":{"@id":"https:\/\/infinitylearn.com\/surge\/#\/schema\/person\/d647d4ff3a1111ff8eeccdb6b12651cb"},"headline":"Prime Number Formula\u00a0","datePublished":"2023-06-20T16:31:17+00:00","dateModified":"2025-02-28T11:44:59+00:00","mainEntityOfPage":{"@id":"https:\/\/infinitylearn.com\/surge\/formulas\/prime-number-formula\/#webpage"},"wordCount":1130,"publisher":{"@id":"https:\/\/infinitylearn.com\/surge\/#organization"},"articleSection":["Formulas","Math Formulas"],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/infinitylearn.com\/surge\/#\/schema\/person\/d647d4ff3a1111ff8eeccdb6b12651cb","name":"Ankit","image":{"@type":"ImageObject","@id":"https:\/\/infinitylearn.com\/surge\/#personlogo","inLanguage":"en-US","url":"https:\/\/secure.gravatar.com\/avatar\/b1068bdc2711bd9c9f8be3b229f758f6?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/b1068bdc2711bd9c9f8be3b229f758f6?s=96&d=mm&r=g","caption":"Ankit"},"url":"https:\/\/infinitylearn.com\/surge\/author\/ankit\/"}]}},"_links":{"self":[{"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/posts\/622707"}],"collection":[{"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/users\/53"}],"replies":[{"embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/comments?post=622707"}],"version-history":[{"count":0,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/posts\/622707\/revisions"}],"wp:attachment":[{"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/media?parent=622707"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/categories?post=622707"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/tags?post=622707"},{"taxonomy":"table_tags","embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/table_tags?post=622707"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}