# APL Hacking: Project Euler Daily (#4)

Problem #4:

∇R←PEFOUR;X;Y;⎕IO ⎕IO←1⍝ Find the largest palindrome made from the product of two 3-digit numbers.

X←99↓⍳999 ⋄ X←(6⍴10)⊤∪,X∘.×X ⋄ Y←⊖X

R←⌈/(^⌿X=Y)/10⊥X

∇

• 1 min read

Problem #4:

∇R←PEFOUR;X;Y;⎕IO ⎕IO←1⍝ Find the largest palindrome made from the product of two 3-digit numbers.

X←99↓⍳999 ⋄ X←(6⍴10)⊤∪,X∘.×X ⋄ Y←⊖X

R←⌈/(^⌿X=Y)/10⊥X

∇

Enter your email

Subscribe