Search results
Results from the WOW.Com Content Network
The final digit of a triangular number is 0, 1, 3, 5, 6, or 8, and thus such numbers never end in 2, 4, 7, or 9. A final 3 must be preceded by a 0 or 5; a final 8 must be preceded by a 2 or 7. In base 10, the digital root of a nonzero triangular number is always 1, 3, 6, or 9. Hence, every triangular number is either divisible by three or has a ...
Each centered triangular number has a remainder of 1 when divided by 3, and the quotient (if positive) is the previous regular triangular number. Each centered triangular number from 10 onwards is the sum of three consecutive regular triangular numbers. For n > 2, the sum of the first n centered triangular numbers is the magic constant for an n ...
Such a number is algebraic and can be expressed as the sum of a rational number and the square root of a rational number. Constructible number: A number representing a length that can be constructed using a compass and straightedge. Constructible numbers form a subfield of the field of algebraic numbers, and include the quadratic surds.
Te n is the sum of all products p × q where (p, q) are ordered pairs and p + q = n + 1; Te n is the number of (n + 2)-bit numbers that contain two runs of 1's in their binary expansion. The largest tetrahedral number of the form + + for some integers and is 8436.
A list of articles about numbers (not about numerals). Topics include powers of ten, notable integers, prime and cardinal numbers, and the myriad system.
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Help; Learn to edit; Community portal; Recent changes; Upload file
Each layer represents one of the first five triangular numbers. A truncated triangular pyramid number [1] is found by removing some smaller tetrahedral number (or triangular pyramidal number) from each of the vertices of a bigger tetrahedral number. The number to be removed may be same or different from each of the vertices. [2]
All square triangular numbers have the form , where is a convergent to the continued fraction expansion of , the square root of 2. [ 4 ] A. V. Sylwester gave a short proof that there are infinitely many square triangular numbers: If the n {\displaystyle n} th triangular number n ( n + 1 ) 2 {\displaystyle {\tfrac {n(n+1)}{2}}} is square, then ...