Given if n is odd then 8 divides n2-1 Proof We can proof the given statement directly. Let n ∈ O Let, P = n2 – 1 We need to prove that P is divisible by 8 P = n2 – 12 P = (n + 1)(n – 1) We know that n is odd. …
We will prove the given statement by contradiction. Let 2n + 1 be a prime number. Let it be P P = 2n + 1 Assume n not be in power of 2. That means one of the multiple of n must be an odd number ( other than one ). Therefore, we can write …
Prove that if 2^n+1 is prime then n is a power of 2 Read More »
We will prove the given statement by contradiction. Suppose 2n – 1 to be prime. Let it be P P = 2n – 1 Assume n is not a prime number. If n is not a prime numer then we can write n = x*y | x, y > 0. From equation 3, it is …
In this article, we will prove that if n is a perfect square then n + 1 is not a perfect square for n > 0. If n is a perfect square, then there exists an integer x such that x2 = n … (1) Now, assume n + 1 to be a perfect square …
Prove that If n is a perfect square then n+1 is not Read More »
In this article, we will prove that if n is a perfect square then n + 2 is not a perfect square for n >= 0. If n is a perfect square, then there exists an integer x such that x2 = n … (1) Now, assume n + 2 to be a perfect square …
Prove that If n is a perfect square then n+2 is not Read More »
We will prove the given statement by direct method. Direct Proof First we will proof in (→) direction “If n is odd then 5n + 6 is odd” Next, we will proof in (←) direction “If 5n+6 is odd, then n is also odd” From the above 2 cases we can conclude that if n …
Prove that if n is a positive integer then n is odd if and only if 5n+6 is odd Read More »
Before proof, we will define some basic terminologies. Bipartite Graph: A graph whose vertices can be divided into 2 disjoint sets such that no two vertices in the same set are adjacent to each other is called Bipartite Graph. Proof We can prove the given statement by contradiction. Suppose you have a bipartite graph G. …
Prove that a graph which contains a triangle cannot be bipartite Read More »
In this article, we will write a program to calculate simple interest and compound interest. The formula for simple interest and compound interest is given below: First the program will ask the user to enter principal amount, time period and rate of interest. Then we will use the above formulas to calculate S.I and C.I.
First we will define some basic terminologies. Bipartite Graph: A graph is bipartite if we can spit the vertices of the graph in two distinct sets V1 and V2 such that no edge connects vertices belonging to the same set. Hamiltonian Graph: A graph is hamiltonian if it contains a hamiltonian circuit. Hamiltonian circuit is …
Prove that a bipartite graph with an odd number of vertices is not hamiltonian Read More »
Write a program to count the number of vowels in a text file in C. Steps Ask the user to enter a file name. Initialize a variable count = 0 to store the vowel count. Read the content of the file character by character. Use a switch statement to check if a character is a vowel or …
C Program to count the number of vowels in a text file Read More »