Project Euler/501 - Revision history

Unknown user: /* Mashing Form 1 and Form 2 Together */

2026-03-29T18:23:29Z

Mashing Form 1 and Form 2 Together

2019-11-23T21:19:58Z

Helpful Facts

← Older revision		Revision as of 21:19, 23 November 2019
Line 479:		Line 479:
	Form 3: <math>15</math>		Form 3: <math>15</math>

	If you~~'re lame you can just~~ add ~~these and you're done~~.		If you want to skip all the hard work, add em up.

	==Links==		==Links==

2019-11-23T21:17:50Z

Mashing Form 1 and Form 2 Together

@@ Line 414: / Line 414: @@
 </pre>
-This now combines the two prior functions:
+This now combines the two functions we had before, <code>form_2</code> and <code>form_1</code>.
 And for form 3 the function stays the same:

2019-11-23T21:17:22Z

Mashing Form 1 and Form 2 Together

@@ Line 414: / Line 414: @@
 </pre>
-Here's the bit for form 3:
+This now combines the two prior functions:
 <pre>
 fun form_2(n):
      cubedRoot = n^(1/3)
@@ Line 442: / Line 434: @@
                  if (pA*pB*pC < n) && (pA != pB) && (pA != pC) && (pB != pC):
                      i += 1
      return i
 </pre>

2019-11-23T21:16:24Z

Mashing Form 1 and Form 2 Together

2019-03-24T21:41:30Z

Cpp Prime Counting Function

← Older revision		Revision as of 21:41, 24 March 2019
Line 483:		Line 483:
	===Cpp Prime Counting Function===		===Cpp Prime Counting Function===

	http://am-just-a-nobody.blogspot.com/2015/11/c-code-for-primepi-function.html		C++ implementation of a prime counting function: http://am-just-a-nobody.blogspot.com/2015/11/c-code-for-primepi-function.html

	~~http://am-just-a-nobody.blogspot.com/~~

	===Helpful Facts===		===Helpful Facts===

2019-03-24T21:41:20Z

Sympy Prime Counting Function

← Older revision		Revision as of 21:41, 24 March 2019
Line 480:		Line 480:

	it takes a good 30 seconds or so.		it takes a good 30 seconds or so.

			===Cpp Prime Counting Function===

			http://am-just-a-nobody.blogspot.com/2015/11/c-code-for-primepi-function.html

			http://am-just-a-nobody.blogspot.com/

	===Helpful Facts===		===Helpful Facts===

2019-03-24T21:40:48Z

Is It Feasible

← Older revision		Revision as of 21:40, 24 March 2019
Line 446:		Line 446:

	If we check the Mathworld page for the prime counting function (http://mathworld.wolfram.com/PrimeCountingFunction.html) we see there are roughly 37 billion primes under a trillion. So even if we have a super efficient prime-finding function, we're going to be counting to 37 billion.		If we check the Mathworld page for the prime counting function (http://mathworld.wolfram.com/PrimeCountingFunction.html) we see there are roughly 37 billion primes under a trillion. So even if we have a super efficient prime-finding function, we're going to be counting to 37 billion.

			This solution (https://euler.stephan-brumme.com/501/) shows an alternative approach, which involves a prime counting function, but it still requires actually iterating over prime numbers, and it only computes/stores prime numbers up to sqrt(n), so I'm not sure how it deals with some of the corner cases above.

	==Side Notes==		==Side Notes==

2019-03-24T21:39:34Z

Mashing Form 1 and Form 2 Together

← Older revision		Revision as of 21:39, 24 March 2019
Line 442:		Line 442:
	return i		return i
	</pre>		</pre>

			===Is It Feasible===

			If we check the Mathworld page for the prime counting function (http://mathworld.wolfram.com/PrimeCountingFunction.html) we see there are roughly 37 billion primes under a trillion. So even if we have a super efficient prime-finding function, we're going to be counting to 37 billion.

	==Side Notes==		==Side Notes==

2019-03-24T21:21:13Z

Mashing Everything Together

@@ Line 378: / Line 378: @@
 </pre>
-===Mashing Everything Together===
+===Mashing Form 1 and Form 2 Together===
 <pre>