diff --git a/solutions/_attachments/5.47a memory.png b/solutions/_attachments/5.47a memory.png
new file mode 100644
index 0000000..7146984
Binary files /dev/null and b/solutions/_attachments/5.47a memory.png differ
diff --git a/solutions/_attachments/5.47b memory.png b/solutions/_attachments/5.47b memory.png
new file mode 100644
index 0000000..a9e9b9c
Binary files /dev/null and b/solutions/_attachments/5.47b memory.png differ
diff --git a/solutions/chapter-05.md b/solutions/chapter-05.md
index fe8823a..ec9ec0d 100644
--- a/solutions/chapter-05.md
+++ b/solutions/chapter-05.md
@@ -176,7 +176,9 @@
 ---
 46. Instruction is ADD, R0, R0, R1. So, R1 should contain enough value to get lowercase version of R0. In ASCII 'a' has 97 and 'A' has 65. So R1 should contain offset value of 32 which is 0000 0000 0010 0000.
 ---
-47. Can't solve.
+47. Solution:    
+	a. ![Solution](_attachments/5.47a%20memory.png)
+	b. ![Solution](_attachments/5.47b%20memory.png)
 ---
 48. If R0 contains zero or positive value which sums of R1 and R2.
 ---