Program to check if N is a Centered Triangular Number

Triangular Matchstick Number

Last Updated : 22 Jun, 2022

Given a number X which represents the floor of a matchstick pyramid, write a program to print the total number of matchstick required to form pyramid of matchsticks of x floors.

Examples:

Input : X = 1
Output : 3

Input : X = 2
Output : 9

This is mainly an extension of triangular numbers. For a number X, the matchstick required will be three times of X-th triangular numbers, i.e., (3*X*(X+1))/2

C++

// C++ program to find X-th triangular
// matchstick number

#include <bits/stdc++.h>
using namespace std;

int numberOfSticks(int x)
{
    return (3 * x * (x + 1)) / 2;
}

int main() 
{
    cout<<numberOfSticks(7);
    return 0;
}

Java

// Java program to find X-th triangular
// matchstick number
public class TriangularPyramidNumber {
    public static int numberOfSticks(int x)
    {
        return (3 * x * (x + 1)) / 2;
    }
    public static void main(String[] args)
    {
        System.out.println(numberOfSticks(7));
    }
}

Python3

# Python program to find X-th triangular
# matchstick number

def numberOfSticks(x):
    return (3 * x * (x + 1)) / 2
    
# main()
print(int(numberOfSticks(7)))

C#

// C# program to find X-th triangular
// matchstick number
using System;

class GFG
{
    // Function to ind missing number
    static int numberOfSticks(int x)
    {
        return (3 * x * (x + 1)) / 2;
    }

    public static void Main()
    {
        Console.Write(numberOfSticks(7));
    }
}

// This code is contributed by _omg

PHP

<?php
// PHP program to find
// X-th triangular
// matchstick number

function numberOfSticks($x)
{
    return (3 * $x * ($x + 1)) / 2;
}

// Driver code
echo(numberOfSticks(7));

// This code is contributed by Ajit.
?>

JavaScript

<script>
// javascript program to find X-th triangular
// matchstick number

function numberOfSticks( x)
{
    return (3 * x * (x + 1)) / 2;
}

   document.write(numberOfSticks(7));

// This code is contributed by aashish1995

</script>

Output:

Time Complexity: O(1)

Auxiliary Space: O(1)

Program to check if N is a Centered Triangular Number

S

Sanket Singh 2

Improve

Article Tags :

Practice Tags :

Mathematical

Similar Reads

Triangular Numbers

A number is termed a triangular number if we can represent it in the form of a triangular grid of points such that the points form an equilateral triangle and each row contains as many points as the row number, i.e., the first row has one point, second row has two points, third row has three points

Centered triangular number

Given an integer n, find the nth Centered triangular number. Centered Triangular Number is a centered polygonal number that represents a triangle with a dot in the center and all other dots surrounding the center in successive triangular layers [Source : Wiki ] Pictorial Representation : The first f

Number of triangles after N moves

Find the number of triangles in Nth step, Rules: Draw an equilateral triangle at the start. In the i-th move, take the uncolored triangles, divides each of them in 4 parts of equal areas and color the central part. Keep a count of triangles till the Nth step. Examples: Input : 1 Output : 5 Explanati

Program to check if N is a Centered Triangular Number

Given an integer N, the task is to check if it is a Centered triangular number or not. Centered triangular number is a centered polygonal number that represents a triangle with a dot in the centre and all other dots surrounding the centre in successive triangular layers . The first few Centered tria

Centered tridecagonal number

Given a number n, the task is to find the nth Centered Tridecagonal Number.Â A Centered tridecagonal number represents a dot at the center and other dots surrounding the center dotÂ in the successive tridecagonal(13 sided polygon) layer. Examples :Â Â Input : 2Â Output : 14 Input : 9Â Output : 469Â Â Â Fo

Rectangular (or Pronic) Numbers

The numbers that can be arranged to form a rectangle are called Rectangular Numbers (also known as Pronic numbers). The first few rectangular numbers are:Â 0, 2, 6, 12, 20, 30, 42, 56, 72, 90, 110, 132, 156, 182, 210, 240, 272, 306, 342, 380, 420, 462 . . . . . .Â Given a number n, find n-th rectangul

Paths of Triangular Number in a Binary Tree

Given a Binary Tree, the task is to output the Count of the number of paths formed by only a Triangular number. Xth Triangular number is the sum of the first X natural numbers. Example: {1, 3, 6, 10 . . .} are triangular numbers. Note: Path should be from root to node. Examples: Input: First test ca

Index of smallest triangular number with N digits

Given a number N, the task is to find the index of smallest triangular number with N digits. A number is termed as a triangular number if we can represent it in the form of a triangular grid of points such that the points form an equilateral triangle and each row contains as many points as the row n

Tridecagonal Number

Given a number N, the task is to find the Nth Tridecagonal number. A tridecagonal number is a figurate number that extends the concept of triangular and square numbers to the tridecagon(a thirteen-sided polygon). The Nth tridecagonal number counts the number of dots in a pattern of N nested tridecag

Triacontagon Number

Given a number N, the task is to find Nth Triacontagon number. An Triacontagon number is class of figurate number. It has 30 - sided polygon called triacontagon. The N-th triacontagonal number countâ€™s the 30 number of dots and all others dots are surrounding with a common sharing corner and make a p