## Java Nested Loop Sample Problem 4

The fourth problem we wish to give is again an enhancement of the first problem in this series that also draws a triangle. This time, we wish to draw an inverted triangle as shown below for input number 5:

*****
****
***
**
*

## Java Nested Loop Sample Problem 2

For the series of drawing triangles using nested loop, we present our second problem that enhances the first problem in this post. This also accepts a number and draws a triangle pattern accordingly. Below is what should be shown when the number input is 5:

1
23
456
7890
12345

## Java Nested Loop Sample Problem 1

For those who wish to improve their logical programming skills, we will be showing simple problems that can be solved using nested loops. Below is our first problem, where given a number will show a pattern. For example, if we are given the number 5, the output of our code should be:

*
**
***
****
*****

## Project Euler Problem 5 Java Solution - Smallest Multiple

We can not code without having logic skills. Programming requires a lot of logic as our foundation. Fortunately, Project Euler is a good source of problems to test our skills. We will provide with solutions to problems in case we wish to test if our answer are correct. We show below the solution to Euler Problem #5 with title - Smallest Multiple.

## Project Euler Problem 4 Java Solution - Largest Palindrome Product

Students of programming should enhance skills in logic. This can be done by practicing increasing difficulty of logical programming challenges. We can find such problems in Project Euler. We provide below solution to Euler Project problems so we can compare our solutions. In here we show a possible code that derives the answer for Euler Problem #4 with title - Largest Palindrome Product.

## Project Euler Problem 3 Java Solution - Largest Prime Factor

In this day and age, developers focus on technologies and frameworks. But it is equally important that we improve our logical skills - that is going back to basics. I highly recommend Project Euler to find such problems to challenge us. Below is a possible code that derives or finds the numerical answer to Euler Problem #3 with title - Largest Prime Factor.

## Project Euler Problem 2 Java Solution - Even Fibonacci Numbers

The basic skill that all programmers and developers should have is logic. This is the basic that enables us to solve more complex problems to deliver solutions to clients. Project Euler is a good source of problems to develop our logic. If we are looking at problems in the project and are stuck, below is a solution to Euler Problem #2 with title - Even Fibonacci Numbers.

## Project Euler Problem 1 Java Solution - Multiples of 3 and 5

The Project Euler is a good place to look for programming logic problems that we can try to solve and develop our skills. After we have developed some abilities in programming, we naturally want to try other problems. Project Euler have problems of varying difficulties, so it is a good place to go as we learn programming. In this post, we will try to show a solution to Euler Problem #1 with title - Multiples of 3 and 5.

## Factorial Java

In mathematics, factorial of a number means taking the product of all positive integers less than or equal to the given number. Or the product of multiplying all numbers from one to the given number. For example, the factorial of 6 is 1x2x3x4x5x6=720. Factorial has many uses, specifically in combinatorics or counting problems, as this is a building block for coming up with more complex counting formula. However, this also have uses in other branch of mathematics, hence writing program that is math heavy may need to have a way of computing factorial. If you are working with the Java programming language, this post might help. This post will show example on how to compute factorial in Java. We will help write a factorial program in Java.

## Fibonacci Java

The Fibonacci sequence is a very popular sequence in Math. The first two numbers in the sequence is 0 and 1. And all the succeeding numbers in the series is derived by adding the previous two numbers before it. For example, the third number in the sequence is derived by adding the first two which is 0 and 1, that equals to 1. The fourth is derived by adding the second and third 1+1 = 2. The fifth number is derived by adding the third and fourth 1+2 =3. And so on. And it is interesting to know that this sequence, which by first impression doesn't make sense, has many application in multiple discipline. For example, some traders who study technical analysis in stocks and other securities has observed that certain patterns in price movements follow the Fibonacci sequence. In software development, particularly in Agile practitioner, they follow task estimation using Fibonacci numbers. There are many more application of this. But this post will try to explore how to generate the Fibonacci series in Java.