Triangular numbers in a mtrix

Question

0.00/5 (No votes)

See more:

Q15) A class Numbers contains the following data members and member functions to fill the cell of NXN matrix with the triangular numbers. [ A triangular number is formed by the addition of a consecutive sequence of integers starting from ‘Num’].
e.g. if Num=1 then

1 + 2 = 3
1 + 2 + 3 = 6
1 + 2 + 3 + 4 = 10
1 + 2 + 3 + 4 + 5 = 15

Therefore, 3, 6, 10, 15 etc. are triangular numbers.

Class name: : Numbers

Data members/ instance variables :
N : integer to store order of matrix.
Num : integer to store starting value of triangular numbers.
Prev :integer to store last value which gave triangular number.
Arr[][] : array to store triangular numbers in array

Member functions/methods
Numbers(int a, int b) :constructor to assign a to N and create matrix of order NXN. Also assign Num=b
Numbers check(int n) : to check if ‘n’ is triangular and initialize ‘n’ to Num if triangular or initialize
Num by next triangular greater than ‘n’and initialize Prev with last value which
gave triangular number.
void fill( ) : to fill the boundary cells of Arr[][]by triangular number beginning from ‘Num’.
void display() :to display the matrix Arr[].
Specify the class Numbers giving details of the functions intcheck(int) and void display( ).

What I have tried:

cannot understand what is to be done in check function

Posted 18-Dec-21 19:16pm

प्रखर शर्मा (Soorma) 2021

Updated 18-Dec-21 19:56pm

Add a Solution

Comments

Richard MacCutchan 19-Dec-21 3:38am

You need to check if it is a triangular number. So you just add 1 +2 + 3 etc. until the total is equal or greater than the value of n. If it equals n then it is a triangular number, if it is greater than n then it is not. For example if the input n is 8 then 1 + 2 + 3 + 4 gives 10 which is greater, so 8 is not triangular.

प्रखर शर्मा (Soorma) 2021 19-Dec-21 5:48am

Can you help me with the code

Richard MacCutchan 19-Dec-21 12:37pm

bool check(int n)
{
    int sum = 0;
    for (int i = 1; sum < n; i++)
    {
        sum += i;
    }
    if (sum == n)
        return true;
    else
        return false;
}

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

OriginalGriff · Accepted Answer · 2021-12-18T19:56:00

While we are more than willing to help those that are stuck, that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us to do it all for you.

So we need you to do the work, and we will help you when you get stuck. That doesn't mean we will give you a step by step solution you can hand in!
Start by explaining where you are at the moment, and what the next step in the process is. Then tell us what you have tried to get that next step working, and what happened when you did.

If you are having problems getting started at all, then this may help: How to Write Code to Solve a Problem, A Beginner's Guide[^]