Junior High Maths

Sunday, 1 January 2017

Problem 1

Prove that n² + n, where n is a whole number, is divisible by 2.

Posted by Từ Nguyên Học at 01:08

Email This BlogThis!Share to X Share to Facebook Share to Pinterest

Labels: divisibility, elementary algebra, induction, polynomial factorisation, whole number

No comments:

Post a Comment

Newer Post Home

Subscribe to: Post Comments (Atom)

Search This Blog

Key Topics

arithmetic (1) arithmetic sequence (2) biprime (1) calculus (1) Cartesian product (1) Chinese remainder theorem (2) composite number (1) cyclic quadrilateral (1) divisibility (6) elementary algebra (14) Euclid's formula (1) Euclidian geometry (6) Euler's phi function (1) Euler's totient function (1) Euler's totient theorem (1) exponentiation (1) Fermat–Euler theorem (1) Fermat's little theorem (2) function of one variable (1) functional equation (1) fundamental theorem of arithmetic (2) geometric sequence (1) Gregorian calendar (1) Hero's formula (1) Heron's formula (1) Heronian triangle (1) induction (9) irrational number (1) isoceles triangle (1) linear congruence equation (4) linear Diophantine equation (2) linear function (1) number theory (11) perfect square (1) polynomial factorisation (3) prime number (3) Ptolemy's theorem (1) Pythagoras' theorem (1) Pythagorean triple (4) reductio ad absurdum (4) semiprime (1) set theory (1) square root (2) summation (4) unique factorization theorem (3) unique-prime-factorization theorem (3) whole number (16)

Popular Posts

Problem 31

A two-digit integer n has the property that the sum of n and its digits is equal to 63. Find n.
Problem 7

Fill in the missing digits to make the number 766776** divisible by 11.
Problem 27

A triangle has side lengths 1 5 , 1 3 and 4 cm. Find the length of the longest altitude.
Problem 24

In a hall, there are 1098 seats. There are two aisles. Each row has the same number of seats. In each row, the number of seats between the a...
Problem 13

Prove that the square root of 201720172017 is an irrational number.
Problem 14

Fill in the missing digit to make the number 66 * divisible by 1 7 .
Problem 16

Prove that there are an infinite number of Pythagorean triples.
Problem 22

If 22 January 2017 is a Sunday, what days was 30 April 1975?
Problem 18

Given a Pythagorean triple a, b, c, prove that if a is odd, then either b or c must be odd.
Problem 15

Prove that if n is an odd number, then n, 0.5 ( n 2 - 1) and 0.5 ( n 2 + 1) form a Pythagorean triple.

Subscribe To

Posts

Posts

Comments

Comments

Blog Archive

▼ 2017 (31)
- ▼ January (31)
  - Problem 31
  - Problem 30
  - Problem 29
  - Problem 28
  - Problem 27
  - Problem 26
  - Problem 25
  - Problem 24
  - Problem 23
  - Problem 22
  - Problem 21
  - Problem 20
  - Problem 19
  - Problem 18
  - Problem 17
  - Problem 16
  - Problem 15
  - Problem 14
  - Problem 13
  - Problem 12
  - Problem 11
  - Problem 10
  - Problem 9
  - Problem 8
  - Problem 7
  - Problem 6
  - Problem 5
  - Problem 4
  - Problem 3
  - Problem 2
  - Problem 1

My Blog List

Junior High Useful

Gérard Villemin
Math Pages

Total Pageviews

2,767

About Me

Từ Nguyên Học

View my complete profile

Simple theme. Powered by Blogger.