Project Euler/500 - Revision history

Admin at 11:12, 14 July 2017

2017-07-14T11:12:06Z

← Older revision		Revision as of 11:12, 14 July 2017
Line 1:		Line 1:
			Problem: https://projecteuler.net/problem=500

	To find the smallest number with 2^n divisors:		To find the smallest number with 2^n divisors:

2017-07-14T11:06:19Z

← Older revision		Revision as of 11:06, 14 July 2017
Line 6:		Line 6:

	Build a generator to generate these numbers dynamically.		Build a generator to generate these numbers dynamically.
	* ~~Wait... what we're building is... uh..~~. the ~~integers in order.~~		* List of primes from sieve.
			* List of queues or sub-generators, each accessing the list of primes and an internal counter

	~~List of primes - that's~~ the ~~first column.~~		Ask the generator to populate up to MAX:
			* It will generate all primes up to MAX
	~~List of queues or sub-generators, each accessing~~ the ~~list of primes and an internal counter~~		* It will decide the order in which to serve these up
			*

	How many primes up do we go for each column?		How many primes up do we go for each column?

2017-07-14T11:02:32Z

← Older revision		Revision as of 11:02, 14 July 2017
Line 5:		Line 5:
	n, n^2, n^4, n^8, n^16, ...		n, n^2, n^4, n^8, n^16, ...

			Build a generator to generate these numbers dynamically.
			* Wait... what we're building is... uh... the integers in order.

			List of primes - that's the first column.

			List of queues or sub-generators, each accessing the list of primes and an internal counter

			How many primes up do we go for each column?
			* If the number we are considering is above p, then we want to include p in the queue of primes that will be served up.
			* If the number we are considering is above p^2, then we want to include p^2 in the queue of primes that will be served up.
			* etc...




			Take the first element in the primes array, square it, and if we're above that, include it



	{{ProjectEulerFlag}}		{{ProjectEulerFlag}}

2017-07-08T08:30:14Z

← Older revision	Revision as of 08:30, 8 July 2017
(No difference)

2017-07-02T07:08:56Z

← Older revision	Revision as of 07:08, 2 July 2017
(No difference)

2017-07-02T07:06:44Z

Created page with "To find the smallest number with 2^n divisors: Building a table with columns: n, n^2, n^4, n^8, n^16, ... {{ProjectEulerFlag}}"

New page

To find the smallest number with 2^n divisors:

Building a table with columns:

n, n^2, n^4, n^8, n^16, ...

{{ProjectEulerFlag}}