Main

processing priority

4

site type

3 (personal blog or private political site, e.g. Blogspot, Substack, also small blogs on own domains)

review version

11

html import

20 (imported)

Events

first seen date

2024-09-26 22:29:57

expired found date

-

created at

2024-09-26 22:29:55

updated at

2025-12-28 20:55:50

Domain name statistics

length

27

crc

48674

tld

2211

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

13642151 (wordpress.com)

previous id

0

replaced with id

0

related id

-

dns primary id

0

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

count skipped due to recent timeouts on the same server IP

0

count content received but rejected due to 11-799

0

count dns errors

0

count cert errors

0

count timeouts

0

count http 429

0

count http 404

0

count http 403

0

count http 5xx

0

next operation date

-

Server

server bits

server ip

-

Mainpage statistics

mp import status

20

mp rejected date

-

mp saved date

-

mp size orig

302465

mp size raw text

18709

mp inner links count

29

mp inner links status

10 (links queued, awaiting import)

Open Graph

title

sylvy's mathsy blog

description

my blog, mostly Maths.

site name

sylvy's mathsy blog

author

updated

2026-03-02 08:46:09

raw text

sylvy's mathsy blog – my blog, mostly Maths. Skip to content sylvy's mathsy blog my blog, mostly Maths. Menu and widgets home thinking about mathematics research Sylvy’s puzzle corner about me Fermat’s Little Theorem One of the first results in any introduction to number theory is Fermat’s Little Theorem, so called in contrast to the Last Theorem, or indeed to any of Fermat’s other results. Theorem 1 (Fermat’s Little Theorem). Let be a prime number and let be any integer. Then In this post — aimed at students taking an introductory course in number theory — I want to explain the two proofs that I find to be the simplest. Neither is deep, but the second requires a tiny bit of group theory, whereas the first does not. 1. First proof: by binomial coefficients We shall take as given that the binomial coefficients , for are natural numbers. We also take as given the Binomial Theorem: Fix a prime number . Lemma 2. For , the binomial co...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

Edukacja (47)

index version

1

spam phrases

0

Text statistics

text nonlatin

0

text cyrillic

0

text characters

13815

text words

2898

text unique words

789

text lines

578

text sentences

251

text paragraphs

40

text words per sentence

11

text matched phrases

0

text matched dictionaries

0

RSS

rss status

32 (unknown)

rss found date

2024-09-26 22:29:59

rss size orig

176040

rss items

10

rss spam phrases

0

rss detected language

1 (English)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap status

40 (completed successful import of reports.txt file to table in_pages)

sitemap review version

2

sitemap urls count

24

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

2024-09-26 22:29:58

sitemap process date

2024-09-26 22:29:58

sitemap first import date

-

sitemap last import date

2025-12-28 20:55:50