A series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding or previous numbers. For example, Fibonacci for 6 is 1, 1, 2, 3, 5, 8, etc.

Read More →A number which is divisible by itself and 1 is called a Prime Number. For Example, 3,5,7,etc. Note: 2 is the only prime even number

Read More →Factorial of a Number n denoted by n! is the product of all consecutive integer numbers upto n. For Example, the value of 5! is 120

Read More →An Integer number in which the sum of the cubes of its digits is equal to the number itself is called Armstrong Number. For example, 153 is an Armstrong number since 1**3 + 5**3 + 3**3 = 153

Read More →In the above pseudocode, we first take three inputs from user and store them in n1, n2 and n3. Then check whether n1 is greater than n2. If n1 is greater than n2, then check again whether n1 is also greater than n3 ......

Read More →In this pseudocode, we first take two inputs from user and store them in n1 and n2. Then check whether n1 is greater than n2. If n1 is greater than n2, then Print "n1 is max", else Print "n2 is max".

Read More →Below are the flowchart and pseudocode to check whether the input integer number is even or odd. READ number; remainder=number%2

Read More →Having Issues Integrating OAuth2 with your Java Spring Boot Project. Let us see what is the issue that occurs when redirecting back to your application after a successful OAuth2 Authentication The reason this error occurs is because when the redirect URL is set under the authorization...

Read More →