Skip to content

Gaurav Sharma's Blog

Articles on Statistics, Machine Learning and Functional Programming

  • About
  • Sample Page

Categories:

  • Algebra
  • Analysis
  • BookExcerpts
  • Circuit Simulation
  • Computer Science
  • Concurrency
  • Design
  • Development Tools
  • Essays on Life and Philosophy
  • Fixed Point
  • Functional Programming
  • Git
  • Hackers
  • Haskell
  • History of Mathematics
  • Inference
  • Interpreters
  • Linear Regression
  • Linear Regression Models
  • Links
  • MapReduce and NoSQL
  • Mathematics
  • Numerical Methods
  • On Writing
  • OOP
  • PaulGrahamEssays
  • Prime Numbers
  • Probability
  • Programming Tasks
  • Quotes
  • Racket
  • Rationality
  • SAS
  • Scheme
  • Sicp Solutions
  • Signal Processing
  • Startups
  • Statistical Software
  • Statistics
  • Tail Recursion
  • Time Series
  • Type Theory
  • Uncategorised
  • Uncategorized

Recent Posts

  • Quotes from Stoic Emperor
  • Hello world!
  • Quotes on Focusing
  • Excerpts from ‘How to Work Hard’
  • Flow – The Psychology of Optimal Experience

Recent Comments

  • A WordPress Commenter on Hello world!

Sicp Exercise 2.41

Exercise 2.41.  Write a procedure to find all ordered triples of distinct positive integers i, j, and k less than or equal to a given integer n that sum to a given integer s.

 

Posted on October 1, 2015Author Gaurav SharmaCategories Functional Programming, Scheme, Sicp Solutions

Post navigation

Previous Previous post: Sicp Exercise 2.40
Next Next post: Sicp Exercise 2.56
Proudly powered by WordPress