answersLogoWhite

0


Best Answer

9

User Avatar

Agustina Macejkovic

Lvl 10
3y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

12y ago

It is not true.

n = 3 is an odd integer.

n of n-1 = 3 of 2 = 6 and 8 DOES NOT DIVIDE 6.

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: If n is an odd integer prove 8 divides n of n-1?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What 3 odd numbers add up to 8?

11


Is the prduct of two prime numbers always even?

No, as 2 is a prime number, the product of 2 prime numbers can be even But all other prime numbers (except 2) are odd then their product is odd (2 x n1+1) x (2 x n2+1) = 2 x (2 x n1 x n2 + n1+ n2) +1


What is the formula for lissajous frequency measurement?

The formula for calculating the frequency of a Lissajous figure is f = (n2-n1) * (f1-f2) / (2 * (n1+n2)), where f is the frequency of the Lissajous figure, n1 and n2 are the integer ratios of the frequencies f1 and f2 on the x and y axes respectively.


Can 9 odd numbers make 50?

An odd number is written 2n+1 with n any number (2n1+1)+(2n2+1)+...+(2n9+1) = 2(n1+n2+...+n9)+9 = 50 is not possible as 2(n1+n2+...+n9) = 41 is not possible with integers


What do you know about the sums and the product of odd and even numbers?

Even numbers : they can be written 2n 2n1+2n2+....+2nm = 2(n1+n2+....+nm) so it's always an even number 2n1x 2n2x....x2nm = 2(n1+n2+....+nm) which is always an even number Odd numbers: they canbe written 2n+1 (2n1+1) + (2n2+1) + ....+ (2nm +1) = 2(n1+n2+....+nm) + m which is even if m is even and odd if m is odd, so it depend of the number of terms (2n1+1) x (2n2+1) x ....x (2nm +1) is always odd cause the last term of the expansion is always +1 and other terms have at least 2 as factor


Codings for coprime number in c?

#include<stdio.h> int main(){ int n1,n2; printf("\nEnter two numbers:"); scanf("%d %d",&n1,&n2); while(n1!=n2){ if(n1>=n2) n1=n1-n2; else n2=n2-n1; } printf("\nGCD=%d",n1); return 0; }


What is the pmf of trinomial distribution?

P(x=n1,y=n2) = (n!/n1!*n2!*(n-n1-n2)) * p1^n1*p2^n2*(1-p1-p2) where n1,n2=0,1,2,....n n1+n2<=n


Find LCM and HCF of two given number by using for loop in c?

#include<stdio.h> int main(){ int n1,n2; printf("\nEnter two numbers:"); scanf("%d %d",&n1,&n2); while(n1!=n2){ if(n1>=n2-1) n1=n1-n2; else n2=n2-n1; } printf("\nGCD=%d",n1); return 0; }


What is the value of the expression n1?

the value of the exponent n1


What is the value of the expression of n1?

the value of the exponent n1


How can you create calculator in computer language cpp?

void main() { int i; float n1,n2; abc: printf("Enter two nos "); scanf("%f%f",&n1,&n2); printf("\n %f + %f = %f " ,n1,n2,n1+n2); printf("\n %f - %f = %f " ,n1,n2,n1-n2); printf("\n %f x %f = %f " ,n1,n2,n1*n2); printf("\n %f / %f = %f " ,n1,n2,n1/n2); printf("\npress 5 to make another calculation"); scanf("%d",&i); if (i==5) goto abc; }


What is the sum of the 10 positive integers?

The sum of the first 10 positive integers, using the formula N1 + (N1 + 1) + ... + N2 = N2 * (N2 + 1) / 2 - (N1 - 1) * N1 / 2 is: 55