![Trending Articles on Technical and Non Technical topics](/images/trending_categories.jpeg)
Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Rinish Patidar has Published 56 Articles
![Rinish Patidar](https://www.tutorialspoint.com/assets/profiles/617319/profile/60_2434475-1678768874.jpg)
Rinish Patidar
227 Views
The problem statement states that we need to write a program to compare m^n and n^m. We need to figure out the algorithm to calculate $m^{n}$ and $n^{m}$ and compare them and print accordingly if $m^{n}$ is greater than $n^{m}$, or if $m^{n}$ is less than $n^{m}$ , or if ... Read More
![Rinish Patidar](https://www.tutorialspoint.com/assets/profiles/617319/profile/60_2434475-1678768874.jpg)
Rinish Patidar
264 Views
A heptagonal number is a number which can be represented as a heptagon. A heptagon is a polygon with 7 sides. A heptagonal number can be represented as a combination of successive layers of heptagon( 7-sided polygon). Heptagonal number can be better explained with the below figures. The first ... Read More
![Rinish Patidar](https://www.tutorialspoint.com/assets/profiles/617319/profile/60_2434475-1678768874.jpg)
Rinish Patidar
401 Views
The problem states that we need to find the GCD that lies in the given range. We will be given two positive integers, x and y and two integers p and q which will be the range as [p, q]. We need to find out the GCD (greatest common divisor) ... Read More
![Rinish Patidar](https://www.tutorialspoint.com/assets/profiles/617319/profile/60_2434475-1678768874.jpg)
Rinish Patidar
255 Views
The problem statement includes checking whether a given number is Polydivisible or not for any given integer N. A polydivisible number, also known as magic number, is a number following a unique pattern. The number created by first p digits of the given number should always be divisible by p ... Read More
![Rinish Patidar](https://www.tutorialspoint.com/assets/profiles/617319/profile/60_2434475-1678768874.jpg)
Rinish Patidar
248 Views
Our task in this problem is to check if the n-th term of a fibonacci like sequence is odd or even. A fibonacci sequence is a type of sequence in mathematics where each number in the sequence is the sum of the preceding two numbers. A nth term of the ... Read More
![Rinish Patidar](https://www.tutorialspoint.com/assets/profiles/617319/profile/60_2434475-1678768874.jpg)
Rinish Patidar
114 Views
The problem statement states that we need to print the N-th centred Hexadecagon numbers for any positive number N. Tridecagonal numbers are the numbers that represent a tridecagon in itself. A tridecagon in mathematics is a polygon which has 13 sides. A centred tridecagonal numbers are the numbers that ... Read More
![Rinish Patidar](https://www.tutorialspoint.com/assets/profiles/617319/profile/60_2434475-1678768874.jpg)
Rinish Patidar
116 Views
Hexadecagonal numbers are the numbers that represent a hexadecagon. Hexadecagon is a polygon which consists of 16 sides. A Centred Hexadecagonal number is the number represented by a dot in the centre and other dots surrounding it in the successive hexadecagonal layers i.e. 16 sided polygon. We can understand the ... Read More
![Rinish Patidar](https://www.tutorialspoint.com/assets/profiles/617319/profile/60_2434475-1678768874.jpg)
Rinish Patidar
199 Views
For N to be a stormer number, the highest prime factor of the expression N^2+1 must be greater than or equal to 2*N and it should be a positive integer. For example, 4 is a stormer number. Since 4*4+1=17 has the greatest prime factor 17 itself which is greater ... Read More
![Rinish Patidar](https://www.tutorialspoint.com/assets/profiles/617319/profile/60_2434475-1678768874.jpg)
Rinish Patidar
701 Views
In this article, we are going to solve the problem of printing first n Fibonacci Numbers using a direct formula. In mathematics, the fibonacci numbers often denoted by Fn (which indicates nth fibonacci number), form a series in which each number is equal to the sum of the preceding two ... Read More
![Rinish Patidar](https://www.tutorialspoint.com/assets/profiles/617319/profile/60_2434475-1678768874.jpg)
Rinish Patidar
230 Views
In this problem, we simply need to print the number of ones in the smallest repunit. A repunit is a positive number like 11, 111, or 1111 in recreational mathematics that only has the digit 1. A repunit is of the form $\mathrm{(10*n-1)/9}$ Example $\mathrm{(10*10-1)/9}$ gives 11. $\mathrm{(10*100-1)/9}$ gives 111. ... Read More