Problem #103 concerns sets of integers with ordered sums of all possible subsets. The question reads: Project Euler Problem 103: Special subset sums: optimum Let S(A) represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the …
Tag Archives: Coding
Project Euler Problem #102
Problem #102 concerns determining whether a point is within the triangle formed by a triple of coordinates. The question reads: Project Euler Problem 102: Triangle containment Three distinct points are plotted at random on a Cartesian plane, for which -1000 ≤ x, y ≤ 1000, such that a triangle is formed. Consider the following two triangles: A(-340,495), B(-153,-910), …
Project Euler Problem #101
Problem #101 concerns polynomials that approximate higher degree polynomials based on consecutive outputs. The question reads: Project Euler Problem 101: Optimum polynomial If we are presented with the first k terms of a sequence it is impossible to say with certainty the value of the next term, as there are infinitely many polynomial functions that can model …
ASU SoDA Coding Challenge VI Medium Question #3
On Sunday, November 24, 2019, I participated in the ASU SoDA Coding Challenge VI. The ASU Software Developer’s Association (SoDA) is a club that is dedicated to teaching aspiring programmers how to solve complex problems that will prepare them for industry. The club runs recruiting events, Hackathons, Interview Prep sessions, and other activities that I …
Continue reading “ASU SoDA Coding Challenge VI Medium Question #3”
ASU SoDA Coding Challenge VI Medium Question #2
On Sunday, November 24, 2019, I participated in the ASU SoDA Coding Challenge VI. The ASU Software Developer’s Association (SoDA) is a club that is dedicated to teaching aspiring programmers how to solve complex problems that will prepare them for industry. The club runs recruiting events, Hackathons, Interview Prep sessions, and other activities that I …
Continue reading “ASU SoDA Coding Challenge VI Medium Question #2”
ASU SoDA Coding Challenge VI Easy Question #4
On Sunday, November 24, 2019, I participated in the ASU SoDA Coding Challenge VI. The ASU Software Developer’s Association (SoDA) is a club that is dedicated to teaching aspiring programmers how to solve complex problems that will prepare them for industry. The club runs recruiting events, Hackathons, Interview Prep sessions, and other activities that I …
Continue reading “ASU SoDA Coding Challenge VI Easy Question #4”
ASU SoDA Coding Challenge VI Easy Question #3
On Sunday, November 24, 2019, I participated in the ASU SoDA Coding Challenge VI. The ASU Software Developer’s Association (SoDA) is a club that is dedicated to teaching aspiring programmers how to solve complex problems that will prepare them for industry. The club runs recruiting events, Hackathons, Interview Prep sessions, and other activities that I …
Continue reading “ASU SoDA Coding Challenge VI Easy Question #3”
ASU SoDA Coding Challenge VI Easy Question #1
On Sunday, November 24, 2019, I participated in the ASU SoDA Coding Challenge VI. The ASU Software Developer’s Association (SoDA) is a club that is dedicated to teaching aspiring programmers how to solve complex problems that will prepare them for industry. The club runs recruiting events, Hackathons, Interview Prep sessions, and other activities that I …
Continue reading “ASU SoDA Coding Challenge VI Easy Question #1”
Project Euler Problem #100
Before I begin, I’d like to state that I will probably take a break from Project Euler for a little while. While writing these first 100 blog posts, I finally accomplished my goal of solving the first 100 problems on Project Euler. When I started, I never expected to make it this far. Writing a …
Project Euler Problem #99
Problem #99 concerns comparing large exponential numbers. The question reads: Project Euler Problem 99: Largest exponential Comparing two numbers written in index form like 211 and 37 is not difficult, as any calculator would confirm that 211 = 2048 < 37 = 2187. However, confirming that 632382518061 > 519432525806 would be much more difficult, as both numbers contain over three million …
The Inner Machinations of Walker 