Prime numbers are also called prime numbers, and there are infinite numbers. A prime number is defined as a natural number greater than 1 that has no other factors except 1 and itself. So how do we use PHP to calculate the sum of prime numbers less than 100? It's actually very simple.
Now we will introduce to you how PHP calculates the sum of prime numbers less than 100.
The code example is as follows:
<?php $primes = array(); $is_prime_no = false; for ($i = 2; $i<100; $i++) { $is_prime_no = true; for ($j = 2; $j<=($i/2); $j++) { if ($i%$j==0) { $is_prime_no = false; break; } } if ($is_prime_no) { array_push($primes,$i); } if (count($primes)==100) { break; } } echo array_sum($primes)."\n";
Output:
1060
Related function introduction:
array_push()The function will One or more elements are pushed onto the end of the array (pushed onto the stack).
array_sum()The function adds all the values in the array and returns the result.
count()The function calculates the number of units in an array, or the number of attributes in an object
Related recommendations: "PHP Tutorial"
This article is an introduction to the method of calculating the sum of prime numbers less than 100 in PHP. I hope it will be helpful to friends in need!
The above is the detailed content of How to calculate the sum of prime numbers less than 100 using PHP?. For more information, please follow other related articles on the PHP Chinese website!