euler-manager 0.0.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +7 -0
- data/.gitignore +21 -0
- data/Gemfile +4 -0
- data/LICENSE.txt +22 -0
- data/README.md +37 -0
- data/Rakefile +1 -0
- data/bin/euler +145 -0
- data/data/answers.yml +456 -0
- data/data/problems/1.yml +7 -0
- data/data/problems/10.yml +8 -0
- data/data/problems/100.yml +13 -0
- data/data/problems/101.yml +49 -0
- data/data/problems/102.yml +16 -0
- data/data/problems/103.yml +26 -0
- data/data/problems/104.yml +15 -0
- data/data/problems/105.yml +21 -0
- data/data/problems/106.yml +19 -0
- data/data/problems/107.yml +20 -0
- data/data/problems/108.yml +32 -0
- data/data/problems/109.yml +33 -0
- data/data/problems/11.yml +33 -0
- data/data/problems/110.yml +19 -0
- data/data/problems/111.yml +21 -0
- data/data/problems/112.yml +15 -0
- data/data/problems/113.yml +13 -0
- data/data/problems/114.yml +106 -0
- data/data/problems/115.yml +17 -0
- data/data/problems/116.yml +76 -0
- data/data/problems/117.yml +82 -0
- data/data/problems/118.yml +9 -0
- data/data/problems/119.yml +11 -0
- data/data/problems/12.yml +13 -0
- data/data/problems/120.yml +17 -0
- data/data/problems/121.yml +15 -0
- data/data/problems/122.yml +42 -0
- data/data/problems/123.yml +13 -0
- data/data/problems/124.yml +58 -0
- data/data/problems/125.yml +12 -0
- data/data/problems/126.yml +17 -0
- data/data/problems/127.yml +31 -0
- data/data/problems/128.yml +18 -0
- data/data/problems/129.yml +12 -0
- data/data/problems/13.yml +6 -0
- data/data/problems/130.yml +19 -0
- data/data/problems/131.yml +12 -0
- data/data/problems/132.yml +12 -0
- data/data/problems/133.yml +13 -0
- data/data/problems/134.yml +19 -0
- data/data/problems/135.yml +20 -0
- data/data/problems/136.yml +17 -0
- data/data/problems/137.yml +36 -0
- data/data/problems/138.yml +20 -0
- data/data/problems/139.yml +15 -0
- data/data/problems/14.yml +28 -0
- data/data/problems/140.yml +29 -0
- data/data/problems/141.yml +14 -0
- data/data/problems/142.yml +14 -0
- data/data/problems/143.yml +20 -0
- data/data/problems/144.yml +30 -0
- data/data/problems/145.yml +11 -0
- data/data/problems/146.yml +9 -0
- data/data/problems/147.yml +14 -0
- data/data/problems/148.yml +11 -0
- data/data/problems/149.yml +41 -0
- data/data/problems/15.yml +11 -0
- data/data/problems/150.yml +34 -0
- data/data/problems/151.yml +19 -0
- data/data/problems/152.yml +12 -0
- data/data/problems/153.yml +57 -0
- data/data/problems/154.yml +16 -0
- data/data/problems/155.yml +22 -0
- data/data/problems/156.yml +27 -0
- data/data/problems/157.yml +34 -0
- data/data/problems/158.yml +19 -0
- data/data/problems/159.yml +29 -0
- data/data/problems/16.yml +6 -0
- data/data/problems/160.yml +8 -0
- data/data/problems/161.yml +15 -0
- data/data/problems/162.yml +15 -0
- data/data/problems/163.yml +19 -0
- data/data/problems/164.yml +8 -0
- data/data/problems/165.yml +32 -0
- data/data/problems/166.yml +15 -0
- data/data/problems/167.yml +17 -0
- data/data/problems/168.yml +13 -0
- data/data/problems/169.yml +10 -0
- data/data/problems/17.yml +11 -0
- data/data/problems/170.yml +16 -0
- data/data/problems/171.yml +13 -0
- data/data/problems/172.yml +6 -0
- data/data/problems/173.yml +12 -0
- data/data/problems/174.yml +20 -0
- data/data/problems/175.yml +21 -0
- data/data/problems/176.yml +9 -0
- data/data/problems/177.yml +16 -0
- data/data/problems/178.yml +9 -0
- data/data/problems/179.yml +10 -0
- data/data/problems/18.yml +21 -0
- data/data/problems/180.yml +34 -0
- data/data/problems/181.yml +7 -0
- data/data/problems/182.yml +35 -0
- data/data/problems/183.yml +27 -0
- data/data/problems/184.yml +18 -0
- data/data/problems/185.yml +22 -0
- data/data/problems/186.yml +28 -0
- data/data/problems/187.yml +16 -0
- data/data/problems/188.yml +10 -0
- data/data/problems/189.yml +15 -0
- data/data/problems/19.yml +12 -0
- data/data/problems/190.yml +13 -0
- data/data/problems/191.yml +15 -0
- data/data/problems/192.yml +27 -0
- data/data/problems/193.yml +7 -0
- data/data/problems/194.yml +18 -0
- data/data/problems/195.yml +13 -0
- data/data/problems/196.yml +25 -0
- data/data/problems/197.yml +16 -0
- data/data/problems/198.yml +21 -0
- data/data/problems/199.yml +14 -0
- data/data/problems/2.yml +10 -0
- data/data/problems/20.yml +22 -0
- data/data/problems/200.yml +12 -0
- data/data/problems/201.yml +20 -0
- data/data/problems/202.yml +14 -0
- data/data/problems/203.yml +21 -0
- data/data/problems/204.yml +11 -0
- data/data/problems/205.yml +10 -0
- data/data/problems/206.yml +6 -0
- data/data/problems/207.yml +20 -0
- data/data/problems/208.yml +12 -0
- data/data/problems/209.yml +27 -0
- data/data/problems/21.yml +13 -0
- data/data/problems/210.yml +10 -0
- data/data/problems/211.yml +11 -0
- data/data/problems/212.yml +41 -0
- data/data/problems/213.yml +11 -0
- data/data/problems/214.yml +15 -0
- data/data/problems/215.yml +18 -0
- data/data/problems/216.yml +14 -0
- data/data/problems/217.yml +27 -0
- data/data/problems/218.yml +14 -0
- data/data/problems/219.yml +19 -0
- data/data/problems/22.yml +13 -0
- data/data/problems/220.yml +24 -0
- data/data/problems/221.yml +20 -0
- data/data/problems/222.yml +7 -0
- data/data/problems/223.yml +12 -0
- data/data/problems/224.yml +12 -0
- data/data/problems/225.yml +11 -0
- data/data/problems/226.yml +16 -0
- data/data/problems/227.yml +13 -0
- data/data/problems/228.yml +23 -0
- data/data/problems/229.yml +30 -0
- data/data/problems/23.yml +19 -0
- data/data/problems/230.yml +23 -0
- data/data/problems/231.yml +16 -0
- data/data/problems/232.yml +14 -0
- data/data/problems/233.yml +10 -0
- data/data/problems/234.yml +23 -0
- data/data/problems/235.yml +9 -0
- data/data/problems/236.yml +32 -0
- data/data/problems/237.yml +13 -0
- data/data/problems/238.yml +42 -0
- data/data/problems/239.yml +9 -0
- data/data/problems/24.yml +10 -0
- data/data/problems/240.yml +11 -0
- data/data/problems/241.yml +17 -0
- data/data/problems/242.yml +16 -0
- data/data/problems/243.yml +19 -0
- data/data/problems/244.yml +32 -0
- data/data/problems/245.yml +36 -0
- data/data/problems/246.yml +17 -0
- data/data/problems/247.yml +21 -0
- data/data/problems/248.yml +6 -0
- data/data/problems/249.yml +7 -0
- data/data/problems/25.yml +15 -0
- data/data/problems/250.yml +7 -0
- data/data/problems/251.yml +13 -0
- data/data/problems/252.yml +31 -0
- data/data/problems/253.yml +36 -0
- data/data/problems/254.yml +21 -0
- data/data/problems/255.yml +59 -0
- data/data/problems/256.yml +43 -0
- data/data/problems/257.yml +18 -0
- data/data/problems/258.yml +13 -0
- data/data/problems/259.yml +16 -0
- data/data/problems/26.yml +11 -0
- data/data/problems/260.yml +30 -0
- data/data/problems/261.yml +19 -0
- data/data/problems/262.yml +20 -0
- data/data/problems/263.yml +19 -0
- data/data/problems/264.yml +20 -0
- data/data/problems/265.yml +16 -0
- data/data/problems/266.yml +10 -0
- data/data/problems/267.yml +14 -0
- data/data/problems/268.yml +8 -0
- data/data/problems/269.yml +15 -0
- data/data/problems/27.yml +25 -0
- data/data/problems/270.yml +17 -0
- data/data/problems/271.yml +13 -0
- data/data/problems/272.yml +15 -0
- data/data/problems/273.yml +21 -0
- data/data/problems/274.yml +23 -0
- data/data/problems/275.yml +19 -0
- data/data/problems/276.yml +11 -0
- data/data/problems/277.yml +24 -0
- data/data/problems/278.yml +32 -0
- data/data/problems/279.yml +6 -0
- data/data/problems/28.yml +17 -0
- data/data/problems/280.yml +13 -0
- data/data/problems/281.yml +17 -0
- data/data/problems/282.yml +10 -0
- data/data/problems/283.yml +11 -0
- data/data/problems/284.yml +22 -0
- data/data/problems/285.yml +17 -0
- data/data/problems/286.yml +12 -0
- data/data/problems/287.yml +36 -0
- data/data/problems/288.yml +15 -0
- data/data/problems/289.yml +19 -0
- data/data/problems/29.yml +24 -0
- data/data/problems/290.yml +8 -0
- data/data/problems/291.yml +10 -0
- data/data/problems/292.yml +13 -0
- data/data/problems/293.yml +15 -0
- data/data/problems/294.yml +10 -0
- data/data/problems/295.yml +26 -0
- data/data/problems/296.yml +15 -0
- data/data/problems/297.yml +19 -0
- data/data/problems/298.yml +46 -0
- data/data/problems/299.yml +31 -0
- data/data/problems/3.yml +7 -0
- data/data/problems/30.yml +12 -0
- data/data/problems/300.yml +24 -0
- data/data/problems/301.yml +25 -0
- data/data/problems/302.yml +18 -0
- data/data/problems/303.yml +11 -0
- data/data/problems/304.yml +19 -0
- data/data/problems/305.yml +14 -0
- data/data/problems/306.yml +29 -0
- data/data/problems/307.yml +12 -0
- data/data/problems/308.yml +34 -0
- data/data/problems/309.yml +17 -0
- data/data/problems/31.yml +18 -0
- data/data/problems/310.yml +19 -0
- data/data/problems/311.yml +21 -0
- data/data/problems/312.yml +15 -0
- data/data/problems/313.yml +17 -0
- data/data/problems/314.yml +29 -0
- data/data/problems/315.yml +49 -0
- data/data/problems/316.yml +25 -0
- data/data/problems/317.yml +11 -0
- data/data/problems/318.yml +61 -0
- data/data/problems/319.yml +23 -0
- data/data/problems/32.yml +14 -0
- data/data/problems/320.yml +12 -0
- data/data/problems/321.yml +18 -0
- data/data/problems/322.yml +12 -0
- data/data/problems/323.yml +19 -0
- data/data/problems/324.yml +17 -0
- data/data/problems/325.yml +25 -0
- data/data/problems/326.yml +12 -0
- data/data/problems/327.yml +39 -0
- data/data/problems/328.yml +36 -0
- data/data/problems/329.yml +17 -0
- data/data/problems/33.yml +13 -0
- data/data/problems/330.yml +40 -0
- data/data/problems/331.yml +28 -0
- data/data/problems/332.yml +16 -0
- data/data/problems/333.yml +25 -0
- data/data/problems/334.yml +39 -0
- data/data/problems/335.yml +16 -0
- data/data/problems/336.yml +24 -0
- data/data/problems/337.yml +15 -0
- data/data/problems/338.yml +41 -0
- data/data/problems/339.yml +17 -0
- data/data/problems/34.yml +7 -0
- data/data/problems/340.yml +14 -0
- data/data/problems/341.yml +18 -0
- data/data/problems/342.yml +17 -0
- data/data/problems/343.yml +29 -0
- data/data/problems/344.yml +21 -0
- data/data/problems/345.yml +26 -0
- data/data/problems/346.yml +11 -0
- data/data/problems/347.yml +16 -0
- data/data/problems/348.yml +12 -0
- data/data/problems/349.yml +13 -0
- data/data/problems/35.yml +8 -0
- data/data/problems/350.yml +18 -0
- data/data/problems/351.yml +13 -0
- data/data/problems/352.yml +49 -0
- data/data/problems/353.yml +25 -0
- data/data/problems/354.yml +16 -0
- data/data/problems/355.yml +8 -0
- data/data/problems/356.yml +10 -0
- data/data/problems/357.yml +9 -0
- data/data/problems/358.yml +31 -0
- data/data/problems/359.yml +26 -0
- data/data/problems/36.yml +8 -0
- data/data/problems/360.yml +12 -0
- data/data/problems/361.yml +20 -0
- data/data/problems/362.yml +32 -0
- data/data/problems/363.yml +33 -0
- data/data/problems/364.yml +15 -0
- data/data/problems/365.yml +17 -0
- data/data/problems/366.yml +26 -0
- data/data/problems/367.yml +20 -0
- data/data/problems/368.yml +39 -0
- data/data/problems/369.yml +15 -0
- data/data/problems/37.yml +10 -0
- data/data/problems/370.yml +16 -0
- data/data/problems/371.yml +13 -0
- data/data/problems/372.yml +16 -0
- data/data/problems/373.yml +10 -0
- data/data/problems/374.yml +25 -0
- data/data/problems/375.yml +23 -0
- data/data/problems/376.yml +25 -0
- data/data/problems/377.yml +11 -0
- data/data/problems/378.yml +15 -0
- data/data/problems/379.yml +15 -0
- data/data/problems/38.yml +18 -0
- data/data/problems/380.yml +22 -0
- data/data/problems/381.yml +21 -0
- data/data/problems/382.yml +23 -0
- data/data/problems/383.yml +13 -0
- data/data/problems/384.yml +28 -0
- data/data/problems/385.yml +22 -0
- data/data/problems/386.yml +16 -0
- data/data/problems/387.yml +19 -0
- data/data/problems/388.yml +12 -0
- data/data/problems/389.yml +12 -0
- data/data/problems/39.yml +10 -0
- data/data/problems/390.yml +18 -0
- data/data/problems/391.yml +29 -0
- data/data/problems/392.yml +22 -0
- data/data/problems/393.yml +12 -0
- data/data/problems/394.yml +22 -0
- data/data/problems/395.yml +19 -0
- data/data/problems/396.yml +28 -0
- data/data/problems/397.yml +20 -0
- data/data/problems/398.yml +13 -0
- data/data/problems/399.yml +22 -0
- data/data/problems/4.yml +8 -0
- data/data/problems/40.yml +18 -0
- data/data/problems/400.yml +18 -0
- data/data/problems/401.yml +11 -0
- data/data/problems/402.yml +25 -0
- data/data/problems/403.yml +19 -0
- data/data/problems/404.yml +21 -0
- data/data/problems/405.yml +15 -0
- data/data/problems/406.yml +46 -0
- data/data/problems/407.yml +20 -0
- data/data/problems/408.yml +14 -0
- data/data/problems/409.yml +12 -0
- data/data/problems/41.yml +8 -0
- data/data/problems/410.yml +19 -0
- data/data/problems/411.yml +23 -0
- data/data/problems/412.yml +19 -0
- data/data/problems/413.yml +13 -0
- data/data/problems/414.yml +40 -0
- data/data/problems/415.yml +19 -0
- data/data/problems/416.yml +13 -0
- data/data/problems/417.yml +21 -0
- data/data/problems/418.yml +17 -0
- data/data/problems/419.yml +22 -0
- data/data/problems/42.yml +14 -0
- data/data/problems/420.yml +13 -0
- data/data/problems/421.yml +29 -0
- data/data/problems/422.yml +22 -0
- data/data/problems/423.yml +22 -0
- data/data/problems/424.yml +37 -0
- data/data/problems/425.yml +16 -0
- data/data/problems/426.yml +29 -0
- data/data/problems/427.yml +18 -0
- data/data/problems/428.yml +32 -0
- data/data/problems/429.yml +10 -0
- data/data/problems/43.yml +17 -0
- data/data/problems/430.yml +20 -0
- data/data/problems/431.yml +33 -0
- data/data/problems/432.yml +13 -0
- data/data/problems/433.yml +18 -0
- data/data/problems/434.yml +32 -0
- data/data/problems/435.yml +21 -0
- data/data/problems/436.yml +21 -0
- data/data/problems/437.yml +22 -0
- data/data/problems/438.yml +29 -0
- data/data/problems/439.yml +17 -0
- data/data/problems/44.yml +16 -0
- data/data/problems/440.yml +21 -0
- data/data/problems/441.yml +23 -0
- data/data/problems/442.yml +9 -0
- data/data/problems/443.yml +13 -0
- data/data/problems/444.yml +28 -0
- data/data/problems/445.yml +37 -0
- data/data/problems/446.yml +29 -0
- data/data/problems/447.yml +31 -0
- data/data/problems/448.yml +14 -0
- data/data/problems/449.yml +17 -0
- data/data/problems/45.yml +15 -0
- data/data/problems/450.yml +26 -0
- data/data/problems/451.yml +15 -0
- data/data/problems/452.yml +8 -0
- data/data/problems/453.yml +16 -0
- data/data/problems/454.yml +17 -0
- data/data/problems/455.yml +16 -0
- data/data/problems/456.yml +15 -0
- data/data/problems/46.yml +18 -0
- data/data/problems/47.yml +21 -0
- data/data/problems/48.yml +7 -0
- data/data/problems/49.yml +10 -0
- data/data/problems/5.yml +8 -0
- data/data/problems/50.yml +10 -0
- data/data/problems/51.yml +15 -0
- data/data/problems/52.yml +8 -0
- data/data/problems/53.yml +28 -0
- data/data/problems/54.yml +43 -0
- data/data/problems/55.yml +21 -0
- data/data/problems/56.yml +11 -0
- data/data/problems/57.yml +15 -0
- data/data/problems/58.yml +22 -0
- data/data/problems/59.yml +23 -0
- data/data/problems/6.yml +13 -0
- data/data/problems/60.yml +10 -0
- data/data/problems/61.yml +30 -0
- data/data/problems/62.yml +9 -0
- data/data/problems/63.yml +7 -0
- data/data/problems/64.yml +130 -0
- data/data/problems/65.yml +62 -0
- data/data/problems/66.yml +27 -0
- data/data/problems/67.yml +17 -0
- data/data/problems/68.yml +23 -0
- data/data/problems/69.yml +14 -0
- data/data/problems/7.yml +6 -0
- data/data/problems/70.yml +16 -0
- data/data/problems/71.yml +17 -0
- data/data/problems/72.yml +16 -0
- data/data/problems/73.yml +16 -0
- data/data/problems/74.yml +41 -0
- data/data/problems/75.yml +16 -0
- data/data/problems/76.yml +8 -0
- data/data/problems/77.yml +8 -0
- data/data/problems/78.yml +12 -0
- data/data/problems/79.yml +11 -0
- data/data/problems/8.yml +6 -0
- data/data/problems/80.yml +11 -0
- data/data/problems/81.yml +19 -0
- data/data/problems/82.yml +19 -0
- data/data/problems/83.yml +23 -0
- data/data/problems/84.yml +63 -0
- data/data/problems/85.yml +9 -0
- data/data/problems/86.yml +15 -0
- data/data/problems/87.yml +12 -0
- data/data/problems/88.yml +53 -0
- data/data/problems/89.yml +18 -0
- data/data/problems/9.yml +13 -0
- data/data/problems/90.yml +23 -0
- data/data/problems/91.yml +19 -0
- data/data/problems/92.yml +29 -0
- data/data/problems/93.yml +21 -0
- data/data/problems/94.yml +11 -0
- data/data/problems/95.yml +23 -0
- data/data/problems/96.yml +46 -0
- data/data/problems/97.yml +14 -0
- data/data/problems/98.yml +16 -0
- data/data/problems/99.yml +16 -0
- data/euler-manager.gemspec +31 -0
- data/euler-manager.sublime-project +12 -0
- data/example/1/README.md +6 -0
- data/example/1/ruby/1.rb +5 -0
- data/example/1/scala/1.scala +9 -0
- data/example/2/README.md +9 -0
- data/example/2/python/2.py +5 -0
- data/example/2/python/euler.py +0 -0
- data/example/Eulerfile.rb +87 -0
- data/example/README.md +26 -0
- data/example/lib/euler.py +0 -0
- data/example/lib/euler.rb +0 -0
- data/example/lib/euler.scala +5 -0
- data/lib/euler.rb +190 -0
- data/lib/euler/errors.rb +7 -0
- data/lib/euler/languages.rb +12 -0
- data/lib/euler/languages/coffeescript.rb +25 -0
- data/lib/euler/languages/javascript.rb +25 -0
- data/lib/euler/languages/python.rb +27 -0
- data/lib/euler/languages/ruby.rb +25 -0
- data/lib/euler/languages/scala.rb +27 -0
- data/lib/euler/languages/templates/coffeescript.coffee +5 -0
- data/lib/euler/languages/templates/javascript.js +5 -0
- data/lib/euler/languages/templates/python.py +5 -0
- data/lib/euler/languages/templates/ruby.rb +5 -0
- data/lib/euler/languages/templates/scala.scala +9 -0
- data/lib/euler/problem.rb +60 -0
- data/lib/euler/solution.rb +98 -0
- data/lib/euler/version.rb +3 -0
- data/scripts/update_problems +68 -0
- data/spec/euler/problem_spec.rb +5 -0
- data/spec/euler/solution_spec.rb +69 -0
- data/spec/euler_spec.rb +27 -0
- data/spec/spec_helper.rb +3 -0
- metadata +644 -0
|
@@ -0,0 +1,41 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 212
|
|
3
|
+
:name: Combined Volume of Cuboids
|
|
4
|
+
:url: http://projecteuler.net/problem=212
|
|
5
|
+
:content: "\r\n<p>An <span style=\"font-style: italic\">axis-aligned cuboid</span>,
|
|
6
|
+
specified by parameters { (x<sub>0</sub>,y<sub>0</sub>,z<sub>0</sub>), (dx,dy,dz)
|
|
7
|
+
}, consists of all points (X,Y,Z) such that x<sub>0</sub><img src=\"images/symbol_le.gif\"
|
|
8
|
+
width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
|
|
9
|
+
X <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
|
|
10
|
+
style=\"vertical-align:middle;\"> x<sub>0</sub>+dx, y<sub>0</sub><img src=\"images/symbol_le.gif\"
|
|
11
|
+
width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
|
|
12
|
+
Y <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
|
|
13
|
+
style=\"vertical-align:middle;\"> y<sub>0</sub>+dy and z<sub>0</sub><img src=\"images/symbol_le.gif\"
|
|
14
|
+
width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
|
|
15
|
+
Z <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
|
|
16
|
+
style=\"vertical-align:middle;\"> z<sub>0</sub>+dz. The volume of the cuboid is
|
|
17
|
+
the product, dx <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
|
|
18
|
+
border=\"0\" style=\"vertical-align:middle;\"> dy <img src=\"images/symbol_times.gif\"
|
|
19
|
+
width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
|
|
20
|
+
dz. The <span style=\"font-style: italic\">combined volume</span> of a collection
|
|
21
|
+
of cuboids is the volume of their union and will be less than the sum of the individual
|
|
22
|
+
volumes if any cuboids overlap.</p>\r\n\r\n<p>Let C<sub>1</sub>,...,C<sub>50000</sub>
|
|
23
|
+
be a collection of 50000 axis-aligned cuboids such that C<sub><var>n</var></sub>
|
|
24
|
+
has parameters</p>\r\n\r\n<p style=\"margin-left:40px;\">x<sub>0</sub> = S<sub>6<var>n</var>-5</sub>
|
|
25
|
+
modulo 10000<br>y<sub>0</sub> = S<sub>6<var>n</var>-4</sub> modulo 10000<br>z<sub>0</sub>
|
|
26
|
+
= S<sub>6<var>n</var>-3</sub> modulo 10000<br>dx = 1 + (S<sub>6<var>n</var>-2</sub>
|
|
27
|
+
modulo 399)<br>dy = 1 + (S<sub>6<var>n</var>-1</sub> modulo 399)<br>dz = 1 + (S<sub>6<var>n</var></sub>
|
|
28
|
+
modulo 399)</p>\r\n\r\n<p>where S<sub>1</sub>,...,S<sub>300000</sub> come from the
|
|
29
|
+
\"Lagged Fibonacci Generator\":</p>\r\n\r\n<p style=\"margin-left:40px;\">For 1
|
|
30
|
+
<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
|
|
31
|
+
style=\"vertical-align:middle;\"><var>k</var> <img src=\"images/symbol_le.gif\"
|
|
32
|
+
width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
|
|
33
|
+
55, S<sub><var>k</var></sub> = [100003 - 200003<var>k</var> + 300007<var>k</var><sup>3</sup>]
|
|
34
|
+
(modulo 1000000)<br>For 56 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
|
|
35
|
+
alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>k</var>, S<sub><var>k</var></sub>
|
|
36
|
+
= [S<sub><var>k</var>-24</sub> + S<sub><var>k</var>-55</sub>] (modulo 1000000)</p>\r\n\r\n<p>Thus,
|
|
37
|
+
C<sub>1</sub> has parameters {(7,53,183),(94,369,56)}, C<sub>2</sub> has parameters
|
|
38
|
+
{(2383,3563,5079),(42,212,344)}, and so on.</p>\r\n\r\n<p>The combined volume of
|
|
39
|
+
the first 100 cuboids, C<sub>1</sub>,...,C<sub>100</sub>, is 723581599.</p>\r\n\r\n<p>What
|
|
40
|
+
is the combined volume of all 50000 cuboids, C<sub>1</sub>,...,C<sub>50000</sub>
|
|
41
|
+
?</p>\r\n"
|
|
@@ -0,0 +1,11 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 213
|
|
3
|
+
:name: Flea Circus
|
|
4
|
+
:url: http://projecteuler.net/problem=213
|
|
5
|
+
:content: "\r\n<p>A 30<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
|
|
6
|
+
alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">30 grid of squares contains
|
|
7
|
+
900 fleas, initially one flea per square.<br>\r\nWhen a bell is rung, each flea
|
|
8
|
+
jumps to an adjacent square at random (usually 4 possibilities, except for fleas
|
|
9
|
+
on the edge of the grid or at the corners).</p>\r\n\r\n<p>What is the expected number
|
|
10
|
+
of unoccupied squares after 50 rings of the bell? Give your answer rounded to six
|
|
11
|
+
decimal places.</p>\r\n"
|
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 214
|
|
3
|
+
:name: Totient Chains
|
|
4
|
+
:url: http://projecteuler.net/problem=214
|
|
5
|
+
:content: "\r\n<p>Let φ be Euler's totient function, i.e. for a natural number <var>n</var>,\r\nφ(<var>n</var>)
|
|
6
|
+
is the number of <var>k</var>, 1 <img src=\"images/symbol_le.gif\" width=\"10\"
|
|
7
|
+
height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>k</var>
|
|
8
|
+
<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
|
|
9
|
+
style=\"vertical-align:middle;\"><var>n</var>, for which gcd(<var>k</var>,<var>n</var>)
|
|
10
|
+
= 1.</p>\r\n\r\n<p>By iterating φ, each positive integer generates a decreasing
|
|
11
|
+
chain of numbers ending in 1.<br>\r\nE.g. if we start with 5 the sequence 5,4,2,1
|
|
12
|
+
is generated.<br>\r\nHere is a listing of all chains with length 4:</p>\r\n\r\n<div
|
|
13
|
+
style=\"text-align:right; margin-right:350px;\">\r\n5,4,2,1<br>\r\n7,6,2,1<br>\r\n8,4,2,1<br>\r\n9,6,2,1<br>\r\n10,4,2,1<br>\r\n12,4,2,1<br>\r\n14,6,2,1<br>\r\n18,6,2,1</div>\r\n\r\n<p>Only
|
|
14
|
+
two of these chains start with a prime, their sum is 12.</p>\r\n\r\n<p>What is the
|
|
15
|
+
sum of all primes less than 40000000 which generate a chain of length 25?</p>\r\n\r\n\r\n\r\n"
|
|
@@ -0,0 +1,18 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 215
|
|
3
|
+
:name: Crack-free Walls
|
|
4
|
+
:url: http://projecteuler.net/problem=215
|
|
5
|
+
:content: "\r\n<p>Consider the problem of building a wall out of 2<img src=\"images/symbol_times.gif\"
|
|
6
|
+
width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">1
|
|
7
|
+
and 3<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
|
|
8
|
+
style=\"vertical-align:middle;\">1 bricks (horizontal<img src=\"images/symbol_times.gif\"
|
|
9
|
+
width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">vertical
|
|
10
|
+
dimensions) such that, for extra strength, the gaps between horizontally-adjacent
|
|
11
|
+
bricks never line up in consecutive layers, i.e. never form a \"running crack\".</p>\r\n\r\n<p>For
|
|
12
|
+
example, the following 9<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
|
|
13
|
+
alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3 wall is not acceptable
|
|
14
|
+
due to the running crack shown in red:</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<img
|
|
15
|
+
src=\"http://projecteuler.net/project/images/p_215_crackfree.gif\" alt=\"\">\n</div>\r\n\r\n<p>There
|
|
16
|
+
are eight ways of forming a crack-free 9<img src=\"images/symbol_times.gif\" width=\"9\"
|
|
17
|
+
height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">3 wall, written
|
|
18
|
+
W(9,3) = 8.</p>\r\n\r\n<p>Calculate W(32,10).</p>\r\n\r\n\r\n\r\n\r\n"
|
|
@@ -0,0 +1,14 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 216
|
|
3
|
+
:name: Investigating the primality of numbers of the form 2<var>n</var><sup>2</sup>-1
|
|
4
|
+
:url: http://projecteuler.net/problem=216
|
|
5
|
+
:content: "\r\n<p>Consider numbers <var>t</var>(<var>n</var>) of the form <var>t</var>(<var>n</var>)
|
|
6
|
+
= 2<var>n</var><sup>2</sup>-1 with <var>n</var> <img src=\"images/symbol_gt.gif\"
|
|
7
|
+
width=\"10\" height=\"10\" alt=\">\" border=\"0\" style=\"vertical-align:middle;\">
|
|
8
|
+
1.<br>\r\nThe first such numbers are 7, 17, 31, 49, 71, 97, 127 and 161.<br>\r\nIt
|
|
9
|
+
turns out that only 49 = 7*7 and 161 = 7*23 are not prime.<br>\r\nFor <var>n</var>
|
|
10
|
+
<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
|
|
11
|
+
style=\"vertical-align:middle;\"> 10000 there are 2202 numbers <var>t</var>(<var>n</var>)
|
|
12
|
+
\ that are prime.</p>\r\n\r\n<p>How many numbers <var>t</var>(<var>n</var>) are
|
|
13
|
+
prime for <var>n</var> <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\"
|
|
14
|
+
alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 50,000,000 ?</p>\r\n\r\n\r\n"
|
|
@@ -0,0 +1,27 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 217
|
|
3
|
+
:name: Balanced Numbers
|
|
4
|
+
:url: http://projecteuler.net/problem=217
|
|
5
|
+
:content: "\r\n<p>\r\nA positive integer with <var>k</var> (decimal) digits is called
|
|
6
|
+
balanced if its first <img src=\"images/symbol_lceil.gif\" width=\"6\" height=\"16\"
|
|
7
|
+
alt=\"⌈\" border=\"0\" style=\"vertical-align:middle;\"><sup><var>k</var></sup>/<sub>2</sub><img
|
|
8
|
+
src=\"images/symbol_rceil.gif\" width=\"6\" height=\"16\" alt=\"⌉\" border=\"0\"
|
|
9
|
+
style=\"vertical-align:middle;\"> digits sum to the same value as its last <img
|
|
10
|
+
src=\"images/symbol_lceil.gif\" width=\"6\" height=\"16\" alt=\"⌈\" border=\"0\"
|
|
11
|
+
style=\"vertical-align:middle;\"><sup><var>k</var></sup>/<sub>2</sub><img src=\"images/symbol_rceil.gif\"
|
|
12
|
+
width=\"6\" height=\"16\" alt=\"⌉\" border=\"0\" style=\"vertical-align:middle;\">
|
|
13
|
+
digits, where <img src=\"images/symbol_lceil.gif\" width=\"6\" height=\"16\" alt=\"⌈\"
|
|
14
|
+
border=\"0\" style=\"vertical-align:middle;\"><var>x</var><img src=\"images/symbol_rceil.gif\"
|
|
15
|
+
width=\"6\" height=\"16\" alt=\"⌉\" border=\"0\" style=\"vertical-align:middle;\">,
|
|
16
|
+
pronounced <span style=\"font-style: italic\">ceiling</span> of <var>x</var>, is
|
|
17
|
+
the smallest integer <img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\"
|
|
18
|
+
alt=\"≥\" border=\"0\" style=\"vertical-align:middle;\"><var>x</var>, thus <img
|
|
19
|
+
src=\"images/symbol_lceil.gif\" width=\"6\" height=\"16\" alt=\"⌈\" border=\"0\"
|
|
20
|
+
style=\"vertical-align:middle;\">π<img src=\"images/symbol_rceil.gif\" width=\"6\"
|
|
21
|
+
height=\"16\" alt=\"⌉\" border=\"0\" style=\"vertical-align:middle;\"> = 4 and <img
|
|
22
|
+
src=\"images/symbol_lceil.gif\" width=\"6\" height=\"16\" alt=\"⌈\" border=\"0\"
|
|
23
|
+
style=\"vertical-align:middle;\">5<img src=\"images/symbol_rceil.gif\" width=\"6\"
|
|
24
|
+
height=\"16\" alt=\"⌉\" border=\"0\" style=\"vertical-align:middle;\"> = 5.</p>\r\n<p>So,
|
|
25
|
+
for example, all palindromes are balanced, as is 13722.</p>\r\n<p>Let T(<var>n</var>)
|
|
26
|
+
be the sum of all balanced numbers less than 10<sup><var>n</var></sup>. <br>\r\nThus:
|
|
27
|
+
T(1) = 45, T(2) = 540 and T(5) = 334795890. </p>\r\n<p>Find T(47) mod 3<sup>15</sup></p>\r\n"
|
|
@@ -0,0 +1,14 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 218
|
|
3
|
+
:name: Perfect right-angled triangles
|
|
4
|
+
:url: http://projecteuler.net/problem=218
|
|
5
|
+
:content: "\r\n<p>Consider the right angled triangle with sides a=7, b=24 and c=25.\r\nThe
|
|
6
|
+
area of this triangle is 84, which is divisible by the perfect numbers 6 and 28.<br>\r\nMoreover
|
|
7
|
+
it is a primitive right angled triangle as gcd(a,b)=1 and gcd(b,c)=1.<br>\r\nAlso
|
|
8
|
+
c is a perfect square.</p>\r\n\r\n<p>We will call a right angled triangle perfect
|
|
9
|
+
if<br>\r\n-it is a primitive right angled triangle<br>\r\n-its hypotenuse is a perfect
|
|
10
|
+
square</p>\r\n\r\n<p>We will call a right angled triangle super-perfect if<br>\r\n-it
|
|
11
|
+
is a perfect right angled triangle and<br>\r\n-its area is a multiple of the perfect
|
|
12
|
+
numbers 6 and 28.\r\n</p>\r\n\r\n<p>How many perfect right-angled triangles with
|
|
13
|
+
c<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
|
|
14
|
+
style=\"vertical-align:middle;\">10<sup>16</sup> exist that are not super-perfect?</p>\r\n\r\n"
|
|
@@ -0,0 +1,19 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 219
|
|
3
|
+
:name: Skew-cost coding
|
|
4
|
+
:url: http://projecteuler.net/problem=219
|
|
5
|
+
:content: "\r\n<p>Let <span style=\"font-weight:bold\">A</span> and <span style=\"font-weight:bold\">B</span>
|
|
6
|
+
be bit strings (sequences of 0's and 1's).<br>\r\nIf <span style=\"font-weight:bold\">A</span>
|
|
7
|
+
is equal to the <span style=\"text-decoration:underline;\">left</span>most length(<span
|
|
8
|
+
style=\"font-weight:bold\">A</span>) bits of <span style=\"font-weight:bold\">B</span>,
|
|
9
|
+
then <span style=\"font-weight:bold\">A</span> is said to be a <span style=\"font-style:italic\">prefix</span>
|
|
10
|
+
of <span style=\"font-weight:bold\">B</span>.<br>\r\nFor example, 00110 is a prefix
|
|
11
|
+
of <span style=\"text-decoration:underline;\">00110</span>1001, but not of 00111
|
|
12
|
+
or 100110.</p>\r\n\r\n<p>A <span style=\"font-style:italic\">prefix-free code of
|
|
13
|
+
size</span> <var>n</var> is a collection of <var>n</var> distinct bit strings such
|
|
14
|
+
that no string is a prefix of any other. For example, this is a prefix-free code
|
|
15
|
+
of size 6:</p>\r\n\r\n<p style=\"text-align:center;\">0000, 0001, 001, 01, 10, 11</p>\r\n\r\n<p>Now
|
|
16
|
+
suppose that it costs one penny to transmit a '0' bit, but four pence to transmit
|
|
17
|
+
a '1'.<br>\r\nThen the total cost of the prefix-free code shown above is 35 pence,
|
|
18
|
+
which happens to be the cheapest possible for the skewed pricing scheme in question.<br>\r\nIn
|
|
19
|
+
short, we write Cost(6) = 35.</p>\r\n\r\n<p>What is Cost(10<sup>9</sup>) ?</p>\r\n"
|
|
@@ -0,0 +1,13 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 22
|
|
3
|
+
:name: Names scores
|
|
4
|
+
:url: http://projecteuler.net/problem=22
|
|
5
|
+
:content: "\r\n\n<p>Using <a href=\"project/names.txt\">names.txt</a> (right click
|
|
6
|
+
and 'Save Link/Target As...'), a 46K text file containing over five-thousand first
|
|
7
|
+
names, begin by sorting it into alphabetical order. Then working out the alphabetical
|
|
8
|
+
value for each name, multiply this value by its alphabetical position in the list
|
|
9
|
+
to obtain a name score.</p>\n<p>For example, when the list is sorted into alphabetical
|
|
10
|
+
order, COLIN, which is worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the
|
|
11
|
+
list. So, COLIN would obtain a score of 938 <img src=\"images/symbol_times.gif\"
|
|
12
|
+
width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
|
|
13
|
+
53 = 49714.</p>\n<p>What is the total of all the name scores in the file?</p>\n\r\n"
|
|
@@ -0,0 +1,24 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 220
|
|
3
|
+
:name: Heighway Dragon
|
|
4
|
+
:url: http://projecteuler.net/problem=220
|
|
5
|
+
:content: "\r\n<p>Let <b><i>D</i></b><sub>0</sub> be the two-letter string \"Fa\".
|
|
6
|
+
\ For n<img src=\"images/symbol_ge.gif\" width=\"10\" height=\"12\" alt=\"≥\" border=\"0\"
|
|
7
|
+
style=\"vertical-align:middle;\">1, derive <b><i>D</i></b><sub>n</sub> from <b><i>D</i></b><sub>n-1</sub>
|
|
8
|
+
by the string-rewriting rules:</p>\r\n\r\n<p style=\"margin-left:40px;\">\"a\" <img
|
|
9
|
+
src=\"images/symbol_maps.gif\" width=\"15\" height=\"7\" alt=\"→\" border=\"0\"
|
|
10
|
+
style=\"vertical-align:middle;\"> \"aRbFR\"<br>\r\n\"b\" <img src=\"images/symbol_maps.gif\"
|
|
11
|
+
width=\"15\" height=\"7\" alt=\"→\" border=\"0\" style=\"vertical-align:middle;\">
|
|
12
|
+
\"LFaLb\"</p>\r\n\r\n<p>Thus, <b><i>D</i></b><sub>0</sub> = \"Fa\", <b><i>D</i></b><sub>1</sub>
|
|
13
|
+
= \"FaRbFR\", <b><i>D</i></b><sub>2</sub> = \"FaRbFRRLFaLbFR\", and so on.</p>\r\n\r\n<p>These
|
|
14
|
+
strings can be interpreted as instructions to a computer graphics program, with
|
|
15
|
+
\"F\" meaning \"draw forward one unit\", \"L\" meaning \"turn left 90 degrees\",
|
|
16
|
+
\"R\" meaning \"turn right 90 degrees\", and \"a\" and \"b\" being ignored. The
|
|
17
|
+
initial position of the computer cursor is (0,0), pointing up towards (0,1).</p>\r\n\r\n<p>Then
|
|
18
|
+
<b><i>D</i></b><sub>n</sub> is an exotic drawing known as the <i>Heighway Dragon</i>
|
|
19
|
+
of order <i>n</i>. For example, <b><i>D</i></b><sub>10</sub> is shown below; counting
|
|
20
|
+
each \"F\" as one step, the highlighted spot at (18,16) is the position reached
|
|
21
|
+
after 500 steps.</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<img src=\"project/images/p_220.gif\"
|
|
22
|
+
alt=\"\">\n</div>\r\n\r\n<p>What is the position of the cursor after 10<sup>12</sup>
|
|
23
|
+
steps in <b><i>D</i></b><sub>50</sub> ?<br>\r\nGive your answer in the form <i>x</i>,<i>y</i>
|
|
24
|
+
with no spaces.</p>\r\n\r\n"
|
|
@@ -0,0 +1,20 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 221
|
|
3
|
+
:name: Alexandrian Integers
|
|
4
|
+
:url: http://projecteuler.net/problem=221
|
|
5
|
+
:content: "\r\n<p>We shall call a positive integer <var>A</var> an \"Alexandrian integer\",
|
|
6
|
+
if there exist integers <var>p</var>, <var>q</var>, <var>r</var> such that:</p>\r\n\r\n<table
|
|
7
|
+
class=\"formula\" style=\"margin-left:50px;\"><tr>\n<td>\r\n <var>A</var> =
|
|
8
|
+
<var>p</var> · <var>q</var> · <var>r</var> and \r\n </td>\r\n <td>\r\n <table
|
|
9
|
+
class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\"><var>A</var></td></tr>\n</table>\n</td>\r\n
|
|
10
|
+
\ <td>=</td>\r\n <td>\r\n <table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td
|
|
11
|
+
class=\"overline\"><var>p</var></td></tr>\n</table>\n</td>\r\n <td>+</td>\r\n
|
|
12
|
+
\ <td>\r\n <table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td class=\"overline\"><var>q</var></td></tr>\n</table>\n</td>\r\n
|
|
13
|
+
\ <td>+</td>\r\n <td>\r\n <table class=\"frac\">\n<tr><td>1</td></tr>\n<tr><td
|
|
14
|
+
class=\"overline\"><var>r</var></td></tr>\n</table>\n</td>\r\n</tr></table>\n<p>For
|
|
15
|
+
example, 630 is an Alexandrian integer (<var>p</var> = 5, <var>q</var> = <img src=\"images/symbol_minus.gif\"
|
|
16
|
+
width=\"9\" height=\"3\" alt=\"−\" border=\"0\" style=\"vertical-align:middle;\">7,
|
|
17
|
+
<var>r</var> = <img src=\"images/symbol_minus.gif\" width=\"9\" height=\"3\" alt=\"−\"
|
|
18
|
+
border=\"0\" style=\"vertical-align:middle;\">18).\r\nIn fact, 630 is the 6<sup>th</sup>
|
|
19
|
+
Alexandrian integer, the first 6 Alexandrian integers being: 6, 42, 120, 156, 420
|
|
20
|
+
and 630.</p>\r\n\r\n<p>Find the 150000<sup>th</sup> Alexandrian integer.</p>\r\n"
|
|
@@ -0,0 +1,7 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 222
|
|
3
|
+
:name: Sphere Packing
|
|
4
|
+
:url: http://projecteuler.net/problem=222
|
|
5
|
+
:content: "\r\n<p>What is the length of the shortest pipe, of internal radius 50mm,
|
|
6
|
+
that can fully contain 21 balls of radii 30mm, 31mm, ..., 50mm?</p>\r\n\r\n<p>Give
|
|
7
|
+
your answer in micrometres (10<sup>-6</sup> m) rounded to the nearest integer.</p>\r\n"
|
|
@@ -0,0 +1,12 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 223
|
|
3
|
+
:name: Almost right-angled triangles I
|
|
4
|
+
:url: http://projecteuler.net/problem=223
|
|
5
|
+
:content: "\r\n<p>Let us call an integer sided triangle with sides <var>a</var> <img
|
|
6
|
+
src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>b</var>
|
|
7
|
+
<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
|
|
8
|
+
style=\"vertical-align:middle;\"><var>c</var> <i>barely acute</i> if the sides satisfy
|
|
9
|
+
<br><var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>c</var><sup>2</sup>
|
|
10
|
+
+ 1.</p>\r\n\r\n<p>How many barely acute triangles are there with perimeter <img
|
|
11
|
+
src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
|
|
12
|
+
25,000,000?</p>\r\n\r\n \r\n\r\n"
|
|
@@ -0,0 +1,12 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 224
|
|
3
|
+
:name: Almost right-angled triangles II
|
|
4
|
+
:url: http://projecteuler.net/problem=224
|
|
5
|
+
:content: "\r\n<p>Let us call an integer sided triangle with sides <var>a</var> <img
|
|
6
|
+
src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"><var>b</var>
|
|
7
|
+
<img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\"
|
|
8
|
+
style=\"vertical-align:middle;\"><var>c</var> <i>barely obtuse</i> if the sides
|
|
9
|
+
satisfy <br><var>a</var><sup>2</sup> + <var>b</var><sup>2</sup> = <var>c</var><sup>2</sup>
|
|
10
|
+
- 1.</p>\r\n\r\n<p>How many barely obtuse triangles are there with perimeter <img
|
|
11
|
+
src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\">
|
|
12
|
+
75,000,000?</p>\r\n\r\n"
|
|
@@ -0,0 +1,11 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 225
|
|
3
|
+
:name: Tribonacci non-divisors
|
|
4
|
+
:url: http://projecteuler.net/problem=225
|
|
5
|
+
:content: "\r\n<p>\r\nThe sequence 1, 1, 1, 3, 5, 9, 17, 31, 57, 105, 193, 355, 653,
|
|
6
|
+
1201 ...<br>\r\nis defined by T<sub>1</sub> = T<sub>2</sub> = T<sub>3</sub> = 1
|
|
7
|
+
and T<sub><var>n</var></sub> = T<sub><var>n</var>-1</sub> + T<sub><var>n</var>-2</sub>
|
|
8
|
+
+ T<sub><var>n</var>-3</sub>.\r\n</p>\r\n<p>\r\nIt can be shown that 27 does not
|
|
9
|
+
divide any terms of this sequence.<br>In fact, 27 is the first odd number with this
|
|
10
|
+
property.</p>\r\n<p>\r\nFind the 124<sup>th</sup> odd number that does not divide
|
|
11
|
+
any terms of the above sequence.</p>\r\n"
|
|
@@ -0,0 +1,16 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 226
|
|
3
|
+
:name: A Scoop of Blancmange
|
|
4
|
+
:url: http://projecteuler.net/problem=226
|
|
5
|
+
:content: "\r\n<p>The <i>blancmange curve</i> is the set of points (<var>x</var>,<var>y</var>)
|
|
6
|
+
such that 0 <img src=\"images/symbol_le.gif\" width=\"10\" height=\"12\" alt=\"≤\"
|
|
7
|
+
border=\"0\" style=\"vertical-align:middle;\"> <var>x</var> <img src=\"images/symbol_le.gif\"
|
|
8
|
+
width=\"10\" height=\"12\" alt=\"≤\" border=\"0\" style=\"vertical-align:middle;\"> 1
|
|
9
|
+
and <img src=\"project/images/p_226_formula.gif\" style=\"vertical-align:middle;\"
|
|
10
|
+
alt=\"\"> ,<br>where <var>s</var>(<var>x</var>) = the distance from <var>x</var>
|
|
11
|
+
to the nearest integer.</p>\r\n\r\n<p>The area under the blancmange curve is equal
|
|
12
|
+
to ½, shown in pink in the diagram below.</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<img
|
|
13
|
+
src=\"project/images/p_226_scoop2.gif\" alt=\"blancmange curve\">\n</div>\r\n\r\n<p>Let
|
|
14
|
+
<var>C</var> be the circle with centre (¼,&frac12) and radius ¼, shown in black
|
|
15
|
+
in the diagram.</p>\r\n\r\n<p>What area under the blancmange curve is enclosed by
|
|
16
|
+
<var>C</var>?<br>Give your answer rounded to eight decimal places in the form <i>0.abcdefgh</i></p>\r\n\r\n"
|
|
@@ -0,0 +1,13 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 227
|
|
3
|
+
:name: The Chase
|
|
4
|
+
:url: http://projecteuler.net/problem=227
|
|
5
|
+
:content: "\r\n<p>\"<i>The Chase</i>\" is a game played with two dice and an even
|
|
6
|
+
number of players.</p>\r\n\r\n<p>The players sit around a table; the game begins
|
|
7
|
+
with two opposite players having one die each. On each turn, the two players with
|
|
8
|
+
a die roll it.<br>\r\nIf a player rolls a 1, he passes the die to his neighbour
|
|
9
|
+
on the left; if he rolls a 6, he passes the die to his neighbour on the right; otherwise,
|
|
10
|
+
he keeps the die for the next turn.<br>\r\nThe game ends when one player has both
|
|
11
|
+
dice after they have been rolled and passed; that player has then lost.</p>\r\n\r\n<p>In
|
|
12
|
+
a game with 100 players, what is the expected number of turns the game lasts?</p>\r\n<p>Give
|
|
13
|
+
your answer rounded to ten significant digits.</p>\r\n"
|
|
@@ -0,0 +1,23 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 228
|
|
3
|
+
:name: Minkowski Sums
|
|
4
|
+
:url: http://projecteuler.net/problem=228
|
|
5
|
+
:content: "\r\n<p>Let <var>S</var><sub>n</sub> be the regular <var>n</var>-sided polygon
|
|
6
|
+
– or <i>shape</i> – whose vertices \r\n\r\n<var>v</var><sub><var>k</var></sub> (<var>k</var> = 1,2,…,<var>n</var>)
|
|
7
|
+
have coordinates:</p>\r\n<table>\n<tr>\n<td width=\"40\"></td>\r\n <td>\n<var>x</var><sub><var>k</var></sub> =
|
|
8
|
+
\r\n cos( <sup>2<var>k</var>-1</sup>/<sub><var>n</var></sub><img src=\"images/symbol_times.gif\"
|
|
9
|
+
width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">180° )</td>\r\n
|
|
10
|
+
\ </tr>\n<tr>\n<td width=\"40\"></td>\r\n <td>\n<var>y</var><sub><var>k</var></sub> =
|
|
11
|
+
\r\n sin( <sup>2<var>k</var>-1</sup>/<sub><var>n</var></sub><img src=\"images/symbol_times.gif\"
|
|
12
|
+
width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">180° )</td>\r\n
|
|
13
|
+
\ </tr>\n</table>\n<p>Each <var>S</var><sub><var>n</var></sub> is to be interpreted
|
|
14
|
+
as a filled shape consisting of all points on the perimeter and in the interior.</p>\r\n\r\n<p>The
|
|
15
|
+
<i>Minkowski sum</i>, <var>S</var>+<var>T</var>, of two shapes <var>S</var> and
|
|
16
|
+
<var>T</var> is the result of \r\n\r\nadding every point in <var>S</var> to every
|
|
17
|
+
point in <var>T</var>, where point addition is performed coordinate-wise: \r\n\r\n(<var>u</var>, <var>v</var>)
|
|
18
|
+
+ (<var>x</var>, <var>y</var>) = (<var>u</var>+<var>x</var>, <var>v</var>+<var>y</var>).</p>\r\n\r\n<p>For
|
|
19
|
+
example, the sum of <var>S</var><sub>3</sub> and <var>S</var><sub>4</sub> is the
|
|
20
|
+
six-sided shape shown in pink below:</p>\r\n\r\n<div style=\"text-align:center;\">\r\n<img
|
|
21
|
+
src=\"project/images/p_228.png\" alt=\"picture showing S_3 + S_4\">\n</div>\r\n\r\n<p>How
|
|
22
|
+
many sides does <var>S</var><sub>1864</sub> + <var>S</var><sub>1865</sub> + … + <var>S</var><sub>1909</sub>
|
|
23
|
+
have?</p>\r\n"
|
|
@@ -0,0 +1,30 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 229
|
|
3
|
+
:name: Four Representations using Squares
|
|
4
|
+
:url: http://projecteuler.net/problem=229
|
|
5
|
+
:content: "\r\n<p>Consider the number 3600. It is very special, because</p>\r\n<div
|
|
6
|
+
style=\"margin-left:200px;\">\r\n3600 = 48<sup>2</sup> + 36<sup>2</sup><br><br>\r\n3600
|
|
7
|
+
= 20<sup>2</sup> + 2<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
|
|
8
|
+
alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">40<sup>2</sup><br><br>\r\n3600
|
|
9
|
+
= 30<sup>2</sup> + 3<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
|
|
10
|
+
alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">30<sup>2</sup><br><br>\r\n3600
|
|
11
|
+
= 45<sup>2</sup> + 7<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
|
|
12
|
+
alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">15<sup>2</sup><br><br>\n</div>\r\n\r\n<p>Similarly,
|
|
13
|
+
we find that 88201 = 99<sup>2</sup> + 280<sup>2</sup> = 287<sup>2</sup> + 2<img
|
|
14
|
+
src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
|
|
15
|
+
style=\"vertical-align:middle;\">54<sup>2</sup> = 283<sup>2</sup> + 3<img src=\"images/symbol_times.gif\"
|
|
16
|
+
width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">52<sup>2</sup>
|
|
17
|
+
= 197<sup>2</sup> + 7<img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\"
|
|
18
|
+
alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">84<sup>2</sup>.</p>\r\n\r\n<p>In
|
|
19
|
+
1747, Euler proved which numbers are representable as a sum of two squares.\r\nWe
|
|
20
|
+
are interested in the numbers <var>n</var> which admit representations of all of
|
|
21
|
+
the following four types:</p>\r\n<div style=\"margin-left:200px;\">\r\n<var>n</var>
|
|
22
|
+
= <var>a<sub>1</sub></var><sup>2</sup> + <var>b<sub>1</sub></var><sup>2</sup><br><br><var>n</var>
|
|
23
|
+
= <var>a<sub>2</sub></var><sup>2</sup> + 2 <var>b<sub>2</sub></var><sup>2</sup><br><br><var>n</var>
|
|
24
|
+
= <var>a<sub>3</sub></var><sup>2</sup> + 3 <var>b<sub>3</sub></var><sup>2</sup><br><br><var>n</var>
|
|
25
|
+
= <var>a<sub>7</sub></var><sup>2</sup> + 7 <var>b<sub>7</sub></var><sup>2</sup>,\r\n</div>\r\n<p>where
|
|
26
|
+
the <var>a</var><sub><var>k</var></sub> and <var>b</var><sub><var>k</var></sub>
|
|
27
|
+
are positive integers.</p>\r\n\r\n<p>There are 75373 such numbers that do not exceed
|
|
28
|
+
10<sup>7</sup>.<br>\r\n\r\nHow many such numbers are there that do not exceed 2<img
|
|
29
|
+
src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
|
|
30
|
+
style=\"vertical-align:middle;\">10<sup>9</sup>?</p>\r\n"
|
|
@@ -0,0 +1,19 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 23
|
|
3
|
+
:name: Non-abundant sums
|
|
4
|
+
:url: http://projecteuler.net/problem=23
|
|
5
|
+
:content: "\r\n<p>A perfect number is a number for which the sum of its proper divisors
|
|
6
|
+
is exactly equal to the number. For example, the sum of the proper divisors of 28
|
|
7
|
+
would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.</p>\r\n<p>A
|
|
8
|
+
number <var>n</var> is called deficient if the sum of its proper divisors is less
|
|
9
|
+
than <var>n</var> and it is called abundant if this sum exceeds <var>n</var>.</p>\r\n<!--
|
|
10
|
+
<p>A number whose proper divisors are less than the number is called deficient and
|
|
11
|
+
a number whose proper divisors exceed the number is called abundant.</p> -->\r\n<p>As
|
|
12
|
+
12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number
|
|
13
|
+
that can be written as the sum of two abundant numbers is 24. By mathematical analysis,
|
|
14
|
+
it can be shown that all integers greater than 28123 can be written as the sum of
|
|
15
|
+
two abundant numbers. However, this upper limit cannot be reduced any further by
|
|
16
|
+
analysis even though it is known that the greatest number that cannot be expressed
|
|
17
|
+
as the sum of two abundant numbers is less than this limit.</p>\r\n<p>Find the sum
|
|
18
|
+
of all the positive integers which cannot be written as the sum of two abundant
|
|
19
|
+
numbers.</p>\r\n\r\n"
|
|
@@ -0,0 +1,23 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 230
|
|
3
|
+
:name: Fibonacci Words
|
|
4
|
+
:url: http://projecteuler.net/problem=230
|
|
5
|
+
:content: "\r\n<p>For any two strings of digits, A and B, we define F<sub>A,B</sub>
|
|
6
|
+
to be the sequence (A,B,AB,BAB,ABBAB,...) in which each term is the concatenation
|
|
7
|
+
of the previous two.</p>\r\n\r\n<p>Further, we define D<sub>A,B</sub>(<var>n</var>)
|
|
8
|
+
to be the <var>n</var><sup>th</sup> digit in the first term of F<sub>A,B</sub> that
|
|
9
|
+
contains at least <var>n</var> digits.</p>\r\n\r\n<p>Example:</p>\r\n\r\n<p>Let
|
|
10
|
+
A=1415926535, B=8979323846. We wish to find D<sub>A,B</sub>(35), say.</p>\r\n\r\n<p>The
|
|
11
|
+
first few terms of F<sub>A,B</sub> are:<br>\r\n1415926535<br>\r\n8979323846<br>\r\n14159265358979323846<br>\r\n897932384614159265358979323846<br>\r\n1415926535897932384689793238461415<span
|
|
12
|
+
style=\"color: #FF0000\"><b>9</b></span>265358979323846<br></p>\r\n\r\n<p>Then D<sub>A,B</sub>(35)
|
|
13
|
+
is the 35<sup>th</sup> digit in the fifth term, which is 9.</p>\r\n\r\n<p>Now we
|
|
14
|
+
use for A the first 100 digits of π behind the decimal point:</p>\r\n<p>14159265358979323846264338327950288419716939937510
|
|
15
|
+
<br>\r\n58209749445923078164062862089986280348253421170679 </p>\r\n\r\n<p>and for
|
|
16
|
+
B the next hundred digits:</p>\r\n\r\n<p>82148086513282306647093844609550582231725359408128
|
|
17
|
+
<br>\r\n48111745028410270193852110555964462294895493038196 .</p>\r\n\r\n<p>Find
|
|
18
|
+
<img src=\"images/symbol_sum.gif\" width=\"11\" height=\"14\" alt=\"∑\" border=\"0\"
|
|
19
|
+
style=\"vertical-align:middle;\"><sub><var>n</var> = 0,1,...,17</sub> 10<sup><var>n</var></sup><img
|
|
20
|
+
src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
|
|
21
|
+
style=\"vertical-align:middle;\"> D<sub>A,B</sub>((127+19<var>n</var>)<img src=\"images/symbol_times.gif\"
|
|
22
|
+
width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">7<sup><var>n</var></sup>)
|
|
23
|
+
.</p>\r\n\r\n\r\n\r\n \r\n\r\n"
|
|
@@ -0,0 +1,16 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 231
|
|
3
|
+
:name: The prime factorisation of binomial coefficients
|
|
4
|
+
:url: http://projecteuler.net/problem=231
|
|
5
|
+
:content: "\r\n<p>The binomial coefficient <sup>10</sup>C<sub>3</sub> = 120.<br>\r\n120
|
|
6
|
+
= 2<sup>3</sup><img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\"
|
|
7
|
+
border=\"0\" style=\"vertical-align:middle;\"> 3 <img src=\"images/symbol_times.gif\"
|
|
8
|
+
width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
|
|
9
|
+
5 = 2 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
|
|
10
|
+
style=\"vertical-align:middle;\"> 2 <img src=\"images/symbol_times.gif\" width=\"9\"
|
|
11
|
+
height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\"> 2 <img src=\"images/symbol_times.gif\"
|
|
12
|
+
width=\"9\" height=\"9\" alt=\"×\" border=\"0\" style=\"vertical-align:middle;\">
|
|
13
|
+
3 <img src=\"images/symbol_times.gif\" width=\"9\" height=\"9\" alt=\"×\" border=\"0\"
|
|
14
|
+
style=\"vertical-align:middle;\"> 5, and 2 + 2 + 2 + 3 + 5 = 14.<br>\r\nSo the sum
|
|
15
|
+
of the terms in the prime factorisation of <sup>10</sup>C<sub>3</sub> is 14.\r\n<br><br>\r\nFind
|
|
16
|
+
the sum of the terms in the prime factorisation of <sup>20000000</sup>C<sub>15000000</sub>.\r\n</p>\r\n"
|
|
@@ -0,0 +1,14 @@
|
|
|
1
|
+
---
|
|
2
|
+
:id: 232
|
|
3
|
+
:name: The Race
|
|
4
|
+
:url: http://projecteuler.net/problem=232
|
|
5
|
+
:content: "\r\n<p>Two players share an unbiased coin and take it in turns to play
|
|
6
|
+
\"The Race\". On Player 1's turn, he tosses the coin once: if it comes up Heads,
|
|
7
|
+
he scores one point; if it comes up Tails, he scores nothing. On Player 2's turn,
|
|
8
|
+
she chooses a positive integer <var>T</var> and tosses the coin <var>T</var> times:
|
|
9
|
+
if it comes up all Heads, she scores 2<sup><var>T</var>-1</sup> points; otherwise,
|
|
10
|
+
she scores nothing. Player 1 goes first. The winner is the first to 100 or more
|
|
11
|
+
points.</p>\r\n\r\n<p>On each turn Player 2 selects the number, <var>T</var>, of
|
|
12
|
+
coin tosses that maximises the probability of her winning.</p>\r\n\r\n<p>What is
|
|
13
|
+
the probability that Player 2 wins?</p>\r\n\r\n<p>Give your answer rounded to eight
|
|
14
|
+
decimal places in the form 0.<i>abcdefgh</i> .</p>\r\n"
|