Category: Project Euler

Challenge:

Work out the first ten digits of the sum of the following one-hundred 50-digit numbers.

37107287533902102798797998220837590246510135740250
46376937677490009712648124896970078050417018260538
74324986199524741059474233309513058123726617309629
91942213363574161572522430563301811072406154908250
23067588207539346171171980310421047513778063246676
89261670696623633820136378418383684178734361726757
28112879812849979408065481931592621691275889832738
44274228917432520321923589422876796487670272189318
47451445736001306439091167216856844588711603153276
70386486105843025439939619828917593665686757934951
62176457141856560629502157223196586755079324193331
64906352462741904929101432445813822663347944758178
92575867718337217661963751590579239728245598838407
58203565325359399008402633568948830189458628227828
80181199384826282014278194139940567587151170094390
35398664372827112653829987240784473053190104293586
86515506006295864861532075273371959191420517255829
71693888707715466499115593487603532921714970056938
54370070576826684624621495650076471787294438377604
53282654108756828443191190634694037855217779295145
36123272525000296071075082563815656710885258350721
45876576172410976447339110607218265236877223636045
17423706905851860660448207621209813287860733969412
81142660418086830619328460811191061556940512689692
51934325451728388641918047049293215058642563049483
62467221648435076201727918039944693004732956340691
15732444386908125794514089057706229429197107928209
55037687525678773091862540744969844508330393682126
18336384825330154686196124348767681297534375946515
80386287592878490201521685554828717201219257766954
78182833757993103614740356856449095527097864797581
16726320100436897842553539920931837441497806860984
48403098129077791799088218795327364475675590848030
87086987551392711854517078544161852424320693150332
59959406895756536782107074926966537676326235447210
69793950679652694742597709739166693763042633987085
41052684708299085211399427365734116182760315001271
65378607361501080857009149939512557028198746004375
35829035317434717326932123578154982629742552737307
94953759765105305946966067683156574377167401875275
88902802571733229619176668713819931811048770190271
25267680276078003013678680992525463401061632866526
36270218540497705585629946580636237993140746255962
24074486908231174977792365466257246923322810917141
91430288197103288597806669760892938638285025333403
34413065578016127815921815005561868836468420090470
23053081172816430487623791969842487255036638784583
11487696932154902810424020138335124462181441773470
63783299490636259666498587618221225225512486764533
67720186971698544312419572409913959008952310058822
95548255300263520781532296796249481641953868218774
76085327132285723110424803456124867697064507995236
37774242535411291684276865538926205024910326572967
23701913275725675285653248258265463092207058596522
29798860272258331913126375147341994889534765745501
18495701454879288984856827726077713721403798879715
38298203783031473527721580348144513491373226651381
34829543829199918180278916522431027392251122869539
40957953066405232632538044100059654939159879593635
29746152185502371307642255121183693803580388584903
41698116222072977186158236678424689157993532961922
62467957194401269043877107275048102390895523597457
23189706772547915061505504953922979530901129967519
86188088225875314529584099251203829009407770775672
11306739708304724483816533873502340845647058077308
82959174767140363198008187129011875491310547126581
97623331044818386269515456334926366572897563400500
42846280183517070527831839425882145521227251250327
55121603546981200581762165212827652751691296897789
32238195734329339946437501907836945765883352399886
75506164965184775180738168837861091527357929701337
62177842752192623401942399639168044983993173312731
32924185707147349566916674687634660915035914677504
99518671430235219628894890102423325116913619626622
73267460800591547471830798392868535206946944540724
76841822524674417161514036427982273348055556214818
97142617910342598647204516893989422179826088076852
87783646182799346313767754307809363333018982642090
10848802521674670883215120185883543223812876952786
71329612474782464538636993009049310363619763878039
62184073572399794223406235393808339651327408011116
66627891981488087797941876876144230030984490851411
60661826293682836764744779239180335110989069790714
85786944089552990653640447425576083659976645795096
66024396409905389607120198219976047599490197230297
64913982680032973156037120041377903785566085089252
16730939319872750275468906903707539413042652315011
94809377245048795150954100921645863754710598436791
78639167021187492431995700641917969777599028300699
15368713711936614952811305876380278410754449733078
40789923115535562561142322423255033685442488917353
44889911501440648020369068063960672322193204149535
41503128880339536053299340368006977710650566631954
81234880673210146739058568557934581403627822703280
82616570773948327592232845941706525094512325230608
22918802058777319719839450180888072429661980811197
77158542502016545090413245809786882778948721859617
72107838435069186155435662884062257473692284509516
20849603980134001723930671666823555245252804609722
53503534226472524250874054075591789781264330331690

Programming Language:

LISP

Solution:

(defun sumlist ()
  (defparameter num "37107287533902102798797998220837590246510135740250463769376774900097126481248969700780504170182605387432498619952474105947423330951305812372661730962991942213363574161572522430563301811072406154908250230675882075393461711719803104210475137780632466768926167069662363382013637841838368417873436172675728112879812849979408065481931592621691275889832738442742289174325203219235894228767964876702721893184745144573600130643909116721685684458871160315327670386486105843025439939619828917593665686757934951621764571418565606295021572231965867550793241933316490635246274190492910143244581382266334794475817892575867718337217661963751590579239728245598838407582035653253593990084026335689488301894586282278288018119938482628201427819413994056758715117009439035398664372827112653829987240784473053190104293586865155060062958648615320752733719591914205172558297169388870771546649911559348760353292171497005693854370070576826684624621495650076471787294438377604532826541087568284431911906346940378552177792951453612327252500029607107508256381565671088525835072145876576172410976447339110607218265236877223636045174237069058518606604482076212098132878607339694128114266041808683061932846081119106155694051268969251934325451728388641918047049293215058642563049483624672216484350762017279180399446930047329563406911573244438690812579451408905770622942919710792820955037687525678773091862540744969844508330393682126183363848253301546861961243487676812975343759465158038628759287849020152168555482871720121925776695478182833757993103614740356856449095527097864797581167263201004368978425535399209318374414978068609844840309812907779179908821879532736447567559084803087086987551392711854517078544161852424320693150332599594068957565367821070749269665376763262354472106979395067965269474259770973916669376304263398708541052684708299085211399427365734116182760315001271653786073615010808570091499395125570281987460043753582903531743471732693212357815498262974255273730794953759765105305946966067683156574377167401875275889028025717332296191766687138199318110487701902712526768027607800301367868099252546340106163286652636270218540497705585629946580636237993140746255962240744869082311749777923654662572469233228109171419143028819710328859780666976089293863828502533340334413065578016127815921815005561868836468420090470230530811728164304876237919698424872550366387845831148769693215490281042402013833512446218144177347063783299490636259666498587618221225225512486764533677201869716985443124195724099139590089523100588229554825530026352078153229679624948164195386821877476085327132285723110424803456124867697064507995236377742425354112916842768655389262050249103265729672370191327572567528565324825826546309220705859652229798860272258331913126375147341994889534765745501184957014548792889848568277260777137214037988797153829820378303147352772158034814451349137322665138134829543829199918180278916522431027392251122869539409579530664052326325380441000596549391598795936352974615218550237130764225512118369380358038858490341698116222072977186158236678424689157993532961922624679571944012690438771072750481023908955235974572318970677254791506150550495392297953090112996751986188088225875314529584099251203829009407770775672113067397083047244838165338735023408456470580773088295917476714036319800818712901187549131054712658197623331044818386269515456334926366572897563400500428462801835170705278318394258821455212272512503275512160354698120058176216521282765275169129689778932238195734329339946437501907836945765883352399886755061649651847751807381688378610915273579297013376217784275219262340194239963916804498399317331273132924185707147349566916674687634660915035914677504995186714302352196288948901024233251169136196266227326746080059154747183079839286853520694694454072476841822524674417161514036427982273348055556214818971426179103425986472045168939894221798260880768528778364618279934631376775430780936333301898264209010848802521674670883215120185883543223812876952786713296124747824645386369930090493103636197638780396218407357239979422340623539380833965132740801111666627891981488087797941876876144230030984490851411606618262936828367647447792391803351109890697907148578694408955299065364044742557608365997664579509666024396409905389607120198219976047599490197230297649139826800329731560371200413779037855660850892521673093931987275027546890690370753941304265231501194809377245048795150954100921645863754710598436791786391670211874924319957006419179697775990283006991536871371193661495281130587638027841075444973307840789923115535562561142322423255033685442488917353448899115014406480203690680639606723221932041495354150312888033953605329934036800697771065056663195481234880673210146739058568557934581403627822703280826165707739483275922328459417065250945123252306082291880205877731971983945018088807242966198081119777158542502016545090413245809786882778948721859617721078384350691861554356628840622574736922845095162084960398013400172393067166682355524525280460972253503534226472524250874054075591789781264330331690")
  (defparameter numlist ())
  (loop while (> (length num) 0)
     do (push (parse-integer (subseq num 0 50)) numlist)
       (setq num (subseq num 50)))
  (reduce '+ numlist))

Overview:

Coming soon…

Challenge:

The sequence of triangle numbers is generated by adding the natural numbers. So the 7^th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:

1, 3, 6, 10, 15, 21, 28, 36, 45, 55, …

Let us list the factors of the first seven triangle numbers:

 1: 1
 3: 1,3
 6: 1,2,3,6
10: 1,2,5,10
15: 1,3,5,15
21: 1,3,7,21
28: 1,2,4,7,14,28

We can see that 28 is the first triangle number to have over five divisors.

What is the value of the first triangle number to have over five hundred divisors?

Programming Language:

LISP

Solution:

(defparameter *primes* (gen-primes 2000000))
(setq duplicates '())

(defun isprime-p (num)
  (defparameter isprime T)
  (if (= num 2)
      (setq isprime T)
      (if (< 1 num 10)
	  (loop named loop-1 for x from 2 below num
	       do (if (= (mod num x) 0)
		      (progn (setq isprime NIL)
			     (return-from loop-1 NIL))))
	  (if (>= num 10)
	      (loop named loop-2 for x from 2 to (+ (isqrt num) 1)
		 do (if (or (= (mod num x) 0) (= (- (sqrt num) (isqrt num)) 0)) 
			(progn (setq isprime NIL)
			       (return-from loop-2 NIL))))
	      (setq isprime NIL))))
  (print isprime))

(defun gen-primes (how-many)
  (loop for x from 1 to how-many if (isprime-p x) collect x))

(defun list-prime-factors (num *primes*)
  (defparameter prime-factors ())
  (loop while (> num 1)
      do (loop for x in *primes*
	 do (if (eql 0 (mod num x))
		(progn (push x prime-factors)
		       (setq num (/ num x))))))
					;(if prime-factors
					;(print prime-factors))
  )

(defun how-many-factors (num)
  (setq duplicates '())
  (list-prime-factors num *primes*)
  (list-dupes prime-factors)
  (if duplicates
      (* (reduce '* (mapcar (lambda (z) (+ z 1))
			    (loop for y in duplicates for j from 1 if (oddp j) collect y)))
	 (expt 2 (- (list-length prime-factors)
		    (reduce '+ (loop for x in duplicates for i from 1 if (oddp i) collect x)))))
  (expt 2 (list-length prime-factors))))
      

(defun list-dupes (lst)
  ;; Start Counter at 1 because there will always be at least 1 of the item you are looking for.
  (defparameter counter 1)
  (cond ((null lst) ())
	(t (loop for x in (cdr lst)
	      do (if (= (car lst) x)
		     (progn (setq counter (+ counter 1)))))
	   (if (> counter 1)
					;(format t "(~a ~a) " counter (car lst))
	       (setq duplicates (append (list counter (car lst)) duplicates))) 
	   (list-dupes (remove (car lst) (cdr lst))))))

(defun which-tri-num (num)
  (/ (* num (+ num 1)) 2))

(defun list-factors (num)
  (loop for x from 1 to num if (= (mod num x) 0) collect x))
	    
(defun tri-num-with-this-many-factors (limit)
  (defparameter num 1)
  (loop while (< (how-many-factors (which-tri-num num)) limit)
     do (setq num (+ 1 num)))
  (format t "Triangle number ~a is (~a) and it is the first triangle number with ~a factors.~%" num (which-tri-num num) (how-many-factors (which-tri-num num))))

Overview:

Coming soon…

Challenge:

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.

Find the sum of all the primes below two million.

Programming Language:

LISP

Solution:

(defun isprime-p(num)
  (defparameter isprime T)
  (if (= num 2)
      (setq isprime T)
      (if (< 1 num 10)
	  (loop named loop-1 for x from 2 below num
	       do (if (= (mod num x) 0)
		      (progn (setq isprime NIL)
			     (return-from loop-1 NIL))))
	  (if (>= num 10)
	      (loop named loop-2 for x from 2 to (+ (isqrt num) 1)
		 do (if (or (= (mod num x) 0) (= (- (sqrt num) (isqrt num)) 0)) 
			(progn (setq isprime NIL)
			       (return-from loop-2 NIL))))
	      (setq isprime NIL))))
 (print isprime))

(defun gen-primes (how-many)
  (defparameter primes ())
  (loop for x from 1 to how-many
     do (if (isprime-p x)
	    (push x primes)))
  (format t "Sum of all primes below ~a is: ~a" how-many (reduce '+ primes)))

Overview:

Coming soon…

Challenge:

A Pythagorean triplet is a set of three natural numbers, a < b < c, for which,

a² + b² = c²

For example, 3² + 4² = 9 + 16 = 25 = 5².

There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product abc.

Programming Language:

LISP

Solution:

(defun gen-pytha-triplets ()
  (loop named loop-1 for a from 1 to 1000
     do (loop for b from 1 to 1000
	   do (loop for c from 1 to 1000
		 do (if (and (and (< a b c) (= (+ (* a a) (* b b)) (* c c))) (= (+ a b c) 1000))
			(return-from loop-1 (* a b c)))))))

Overview:

Coming soon…

---

Programming Language:

x86 Assembly

Solution:

; Takes input (n) and prints all triples (a, b, c) such that a^2 + b^2 = c^2 less than n.

format PE console
entry start

include 'win32a.inc'

; ============================================

section '.text' code readable executable

start:				; the program begins here:
	call	read_hex
	mov	ebx, eax
	
loop_1:
	dec	ebx
	mov	ecx, ebx
	cmp	ebx, 0		; check if we've reached end of outermost loop
				; or if input was zero (0).
	jnz	loop_2		; if not zero, start first inner loop
	jmp	exit		; if so, exit

loop_2:
	dec	ecx
	mov	edi, ecx
	cmp	ecx, 0
	jnz	loop_3
	jmp	loop_1

loop_3:
	dec	edi
	cmp	edi, 0		; check if we've reached end of inner loop
	jnz	square_nums	; if not, print number and decrease by 1
	jmp	loop_2

square_nums:
	mov	esi, 0		; initialize esi (our a^2 + b^2) 
				; part of equation to zero.
	mov	eax, edi	; square least num (loop 3 num), or a.
	mul	edi
	add	esi, eax	; add result (a^2) to esi.
	mov	eax, ecx	; square second least num (loop 2 num), or b.
	mul	ecx
	add	esi, eax	; add result (b^2) to esi.
				; esi now contains (a^2 + b^2).	

	mov	eax, ebx	; square largest num (loop 1 num), or c.
	mul	ebx
	
	cmp	esi, eax	; check is (a^2 + b^2), or esi, equals (c^2) or eax.
	jnz	loop_3		; if not, continue to next group of numbers.
				; otherwise, print numbers.

print_num:
	mov	eax, ebx
	call	print_eax
	mov	eax, ecx
	call	print_eax
	mov	eax, edi
	call	print_eax
	jmp	loop_3		; and continue to test next set of numbers.

exit:				; exit the process:
	
	push	0		
	call	[ExitProcess]

include 'training.inc'

Overview:

Coming soon…

Challenge:

The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.

73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450

Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?

Programming Language:

LISP

Solution:

(defparameter numlist (map 'list #'digit-char-p (prin1-to-string 7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450)))

(defun 13thproduct (numlist)
  (defparameter lprod ())
  (loop while numlist
     do (defparameter p 1)
       (loop for x in numlist for y from 1 to 13
	  do (setq p (* p x)))
       (push p lprod)
       (setq numlist (cdr numlist)))
  (apply 'max lprod))

Overview:

Coming soon…

Challenge:

By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.

What is the 10,001st prime number?

Programming Language:

LISP

Solution:

(defun isprime-p(n)
  (defparameter isprime NIL)
  (if (and (oddp n) (> n 2))
      (loop for x from 2 below n
	 do (if (eql 0 (mod n x))
		(progn (setq isprime NIL)
		       (return NIL))
		(setq isprime T))))
  (if (eq n 2)
      (setq isprime T))
  (print isprime))

(defun nth-prime(num)
  (defparameter primes NIL)
  (defparameter p 2)
  (loop while (< (list-length primes) num)
     do (if (eql T (isprime-p p))
	(push p primes))
    (setq p (+ 1 p)))
  (print (car primes)))

Overview:

Coming soon…

---

Programming Language:

x86 Assembly

Solution:

; receives input (n), prints all primes greater than 1 up to n.

format PE console
entry start

include 'win32a.inc'

; ============================================

section '.text' code readable executable

start:				; the program begins here:
	call	read_hex
	mov	ebx, eax	; setup counter in ebx

prime_loop:

	cmp	ebx, 1		; check that counter is
	jbe	exit		; below or equal to 1. if so, exit.
				; otherwise, continue.
	mov	eax, ebx	; move counter's value into eax 
				; (input of 'start_check_prime' loop.

start_check_prime:		

	mov	esi, eax	; store input in esi for later.
	cmp	eax, 2		; if input is 2 (special case prime)
	je	prime		; num is prime. jump to 'prime' label.
	cmp	eax, 3		; if input is 3
	je	prime		; also jump to 'prime' label.

	mov	edx, 0		; initialize edx to 0 for div with 32-bit integers [EDX:EAX].
	mov	ecx, 2		; setup divsor (2)
	div	ecx		; check if input is even and 
				; get half its value for prime check.
	cmp	edx, 0		; if edx is 0, remainder of 'div 2' = 0
	je	n_prime		; input is even.
				; Otherwise input is odd. Check for prime.
	mov	ecx, eax	; setup ecx (counter) with half of input
				; and check divisbility by nums up to ecx.

check_prime:			; check for prime loop

	mov	eax, esi	; restore eax with original input for check_prime.
	mov	edx, 0		; initialize edx to 0 for div with 32-bit integers [EDX:EAX].
	div	ecx		; divide by current ecx (counter) value
	cmp	edx, 0		; if input num is evenly divisible by ecx (counter)
	je	n_prime		; then not prime.
	dec	ecx		; decrease counter by 1
	cmp	ecx, 1		; but make sure counter is above 1 (because all nums evenly
	ja	check_prime	; divisible by 1). if counter is above 1, check next ecx num.
				; once all ecx nums are checked, and no jumps have been made
				; from 'check_prime' loop, then number is prime.
				; continue to following line.


prime:				; number is prime.

	mov	eax, esi		
	call	print_eax
	dec	ebx
	jmp	prime_loop

n_prime:			; number is not prime.

	dec	ebx
	jmp	prime_loop


exit:				; exit the process:
	
	push	0		
	call	[ExitProcess]

include 'training.inc'

Overview:

Coming soon…

Challenge:

The sum of the squares of the first ten natural numbers is,

1² + 2² + … 10² = 385

The square of the sum of the first ten natural numbers is,

(1 + 2 + … + 10)² = 55² = 3025

Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is

3025 – 385 = 2640.

Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.

Programming Language:

LISP

Solution:

(defun sqr(x)
  (* x x))

(defun sum-sqr-diff(lim)
  (- (sqr (apply #'+ (loop for x from 1 to lim collect x)))
     (apply #'+ (mapcar #'sqr (loop for x from 1 to lim collect x)))))

Overview:

Coming soon…

Challenge:

2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.

What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?

Programming Language:

LISP

Solution:

(defun smul (lim)
  (defparameter nlim (apply '* (getprimes lim)))
  (defparameter num nlim)
  (loop while (/= 0 (apply '+ (mapcar (lambda (x) (mod num x))
				      '(1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20))))
     do (setf num (+ num nlim))
       (format t "num is ~a~%: " num)))

(defun isprime-p(n)
  (defparameter isprime NIL)
  (if (and (oddp n) (> n 2))
      (loop for x from 2 below n
	 do (if (eql 0 (mod n x))
		(progn (setq isprime NIL)
		       (return NIL))
		(setq isprime T))))
  (if (eq n 2)
      (setq isprime T))
  (print isprime))

(defun getprimes(lim)
  (defparameter primes NIL)
  (loop for x from 1 to lim
     do (if (eql T (isprime-p x))
	    (push x primes)))
  (print primes))

Overview:

This solution first generates all primes from 1 – “lim” or 20 in this example. Once primes are generated, they are multiplied together and the product is used to generate multiples of that number. These multiples are then tested in smul().

Challenge:

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.

Find the largest palindrome made from the product of two 3-digit numbers.

Programming Language:

LISP

Solution:

(defun 3pal()
  (defparameter l3pal 0)
  (loop for x downfrom 999 to 111
     do (loop for y downfrom 999 to 111
	   do (if (equal (write-to-string (* x y)) (reverse (write-to-string (* x y))))
		  (if (> (* x y) l3pal)
		      (setq l3pal (* x y))))))
  (format t "~a ~%" l3pal))

Overview:

Coming soon…

Challenge:

The prime factors of 13195 are 5, 7, 13 and 29.

What is the largest prime factor of the number 600851475143 ?

Programming Language:

LISP

Solution:

(defun lprimefactor(num)
  (loop for x in (reverse (getprimes 10000))
     do (if (eql 0 (mod num x))
	    (format t "~a is a prime factor of ~a~%" x num))))

(defun isprime-p(n)
  (defparameter isprime NIL)
  (if (and (oddp n) (> n 2))
      (loop for x from 2 below n
	 do (if (eql 0 (mod n x))
		(progn (setq isprime NIL)
		       (return NIL))
		(setq isprime T))))
  (if (eq n 2)
      (setq isprime T))
  (print isprime))

(defun getprimes(lim)
  (defparameter primes NIL)
  (loop for x from 1 to lim
     do (if (eql T (isprime-p x))
	    (push x primes)))
  (print primes))

Overview:

Coming soon…