Euler problems/171 to 180

From HaskellWiki
< Euler problems
Revision as of 06:24, 30 January 2008 by DonStewart (talk | contribs) (Revert vandalism)

Jump to: navigation, search

Problem 171

Finding numbers for which the sum of the squares of the digits is a square.


problem_171 = undefined

Problem 172

Investigating numbers with few repeated digits.


problem_172 = undefined

Problem 173

Using up to one million tiles how many different "hollow" square laminae can be formed? Solution:

    let c=div (10^6) 4
        xm=floor$sqrt $fromIntegral c
        k=[div c x|x<-[1..xm]]
    in  sum k-(div (xm*(xm+1)) 2)

Problem 174

Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements.


problem_174 = undefined

Problem 175

Fractions involving the number of different ways a number can be expressed as a sum of powers of 2. Solution:

sternTree x 0=[]
sternTree x y=
    m:sternTree y n  
    (m,n)=divMod x y
findRat x y
    |odd l=take (l-1) k++[last k-1,1]
    k=sternTree x y
    l=length k
p175 x y= 
    init$foldl (++) "" [a++","|
    a<-map show $reverse $filter (/=0)$findRat x y]
problems_175=p175 123456789 987654321
test=p175 13 17

Problem 176

Rectangular triangles that share a cathetus. Solution:

problem_176 = undefined

Problem 177

Integer angled Quadrilaterals.


problem_177 = undefined

Problem 178

Step Numbers Solution:

problem_178 = undefined

Problem 179

Consecutive positive divisors. Solution:

problem_179 = undefined

Problem 180


problem_180 = undefined