Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 13 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use uniform expectations on the nonempty sets . Define the rectangle fourth moment and the normalized cut norm byThe first quantity is nonnegative, sinceits fourth root is the box norm. To bound the cut norm, fix and put . The Cauchy-Schwarz inequality in givesA second Cauchy-Schwarz inequality, now in , yieldsbecause the squared mean of is at most one. Taking the maximum over rectangles gives the first direction of cut norm and rectangle fourth-moment equivalence:The normalization divides the rectangle sum by and the fourth-moment sum by , so the bound is independent of the two set sizes.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 12 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
False in general. Take , , andIt is a Frankl family with members. Two members each use at least three of the first four points, so they share at least two of those points. Hence it is t-intersecting with , and .
The first fifteen rank-four sets in lexicographic order are precisely those containing . The sixteenth is , which intersects the earlier set only at one. Therefore the lex initial segment of size seventeen is not two-intersecting. This proves that lexicographic replacement can destroy two-intersection; an ordinary intersecting bound cannot justify preservation of higher-order intersection.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 12 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
False in general. On take the rank-two starIt is an intersecting family of four sets and . The first four rank-two sets in colexicographic order areThe members and are disjoint. Thus colexicographic replacement can destroy intersection, despite its shadow-minimizing property.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 12 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Always true, for the ordinary positive-rank intersecting-family convention. The Erdős-Ko-Rado theorem bounds the family's size by . In lexicographic order, the first exactly that many rank- sets are all those containing one. Therefore the initial segment of the given size is contained in that star and any two members intersect at one. This proves that lexicographic initial segments preserve ordinary intersection. Empty families cause no exception. If rank zero is admitted, its layer has just one set and replacement by either initial segment changes nothing, so all three preservation assertions at that rank hold trivially.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 12 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Proceed by induction on the ground-set size, starting with the one-element chain in the Boolean lattice on no coordinates. Suppose a symmetric chain decomposition of a Boolean lattice on has been constructed. Write one of its chains asOn adjoining the new coordinate , replace its two copies byand, when nonempty,The first chain has endpoint ranks , summing to . The second has endpoint ranks , also summing to . Both are saturated chains, increasing rank by one at every step. If the original chain was a singleton, the second chain is omitted.
These new chains are disjoint: the first contains every old set without and just the last old set with ; the second contains precisely the remaining old sets with . Thus together they cover both lifted copies of the old chain. Different old chains have disjoint copies, so performing this construction for each yields a partition of all subsets of into symmetric chains. This completes the induction and proves a symmetric chain partition exists for every .
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 12 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For and a rank- uniform set family , let be its lower shadow. Count pairs with , and . Every contributes pairs, whereas each shadow member lies in at most rank- sets. ThusThis is the Local LYM inequality. Complementation gives the upper-shadow form for .
To deduce the LYM inequality, let be an antichain, its rank- part, and all rank- sets containing some member of . For ,The union is disjoint because an antichain member cannot contain a smaller member; every other set of contains a rank- superset of its smaller witnessing member. Apply the upper local inequality and put :Since and , summing givesThus the deduction uses the local inequality explicitly, rather than quoting a separate maximal-chain argument.
Let , the largest rank size. The LYM sum is at least , proving the Sperner theorem bound. If , equality forces all its members onto ranks with binomial coefficient . For even , there is only the middle rank, so the family is that whole rank.
For , only ranks are possible, each of size . Let . Antichainness gives , and local LYM gives . Since the two antichain parts together have size , equality must hold. The inclusion graph between these ranks is -regular on each side. Its edges from already number , so equality leaves no edge from to the complementary upper vertices.
The graph is connected: exchanging one element between two -sets joins them through their -element union, and successive exchanges connect all lower vertices; every upper vertex has a lower neighbour. Consequently is either empty or the entire upper rank. This connectedness of adjacent-level incidence in a Boolean lattice excludes mixed extremizers. HenceThere is one choice for even and two for odd . For , the sole maximum family is , agreeing with this description.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
LetThis scalar function is continuous. The first element is locally constant; deleting it is continuous on increasing sequences; and evaluation on a fixed is continuous in the weak-star topology. Thus is open.
By part (a), choose an infinite homogeneous for . If all its infinite subsets are in , the required conclusion follows. Suppose instead every one has . Choose finitely many unit scalars such that every scalar with has for some ; for real scalars the two signs suffice. The open setscover . Apply the open Ramsey set of infinite subsets result successively to them. After finitely many refinements, at least one, say , contains every infinite subset of a remaining infinite ; otherwise their cover would be violated.
For any finite , choose an infinite after . For each , apply this homogeneity to . Its deleted tail is always the same , so the same functional satisfiesBut is a weakly null sequence. The Mazur lemma gives a finite convex combination with . The displayed inequalities give , contradicting . The bad homogeneous case is impossible. ThereforeContinuity is used to make the scalar tests open; weak nullity is used only for the finite convex-combination contradiction. The argument works over both real and complex scalars.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 6 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Identify with increasing infinite sequences, with the product topology. A Ramsey set of infinite subsets is one such that for every infinite , some infinite satisfies or . We prove this for open .
For a finite increasing stem and an infinite tail above it, say that accepts if every infinite has . Say that rejects if no infinite subset of accepts it. Either a tail has an accepting refinement, or it rejects. Both acceptance and rejection persist under passage to infinite subsets.
Starting with any infinite ground set , use fusion to obtain an infinite deciding every finite subset of : after selecting its first elements, refine the remaining tail successively to decide each of the finitely many subsets of that prefix. Then select the next element from the refined tail. The final tail beyond a decided stem is contained in the tail which decided it, so the decision survives. In particular decides the empty stem.
If accepts the empty stem, it is homogeneous inside . Otherwise it rejects. We thin it further so that every finite subset is rejected. The key observation is that if rejects , there can be only finitely many above for which accepts . If there were infinitely many, call their set . For any infinite , its first element and the accepting tail would imply . Thus would accept , contradicting rejection.
Build inductively. Given a finite prefix whose subsets are all rejected, exclude the finitely many bad next elements for each of those subsets, and choose the next element outside their union. All new stems are decided by the first fusion and are not accepted, hence are rejected. This preserves the induction.
If an infinite belonged to the open set , some finite initial segment of would have every infinite extension above in . Then would accept , contradicting the rejection just arranged. Therefore misses . We have provedTaking complements gives the same result for closed subsets. The proof also works with any fixed finite stem, yielding the stronger finite-stem version when desired.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For , define the normalized treeThe upper bound follows from normalization. This is a closed tree: it suffices to impose the lower inequalities for a countable dense set of scalar tuples. The Bourgain l1-index iswhere is its well-founded tree order, and the index is if a tree is ill-founded. An infinite branch is exactly a sequence equivalent to the unit vector basis of .
If is separable and contains no , its unit sphere is Polish and every is closed and well-founded. Part (a) makes each order countable, and their countable supremum is countable. In particular every separable reflexive Banach space has countable index, since its closed subspaces are reflexive whereas is not.
We now construct separable reflexive spaces with arbitrarily high index. Take any countable well-founded rooted tree . Recursively, at each node , defineAt a terminal node this is just . The recursion is legitimate by well-foundedness. Each is separable and reflexive: a countable sum of separable reflexive spaces is separable and reflexive, and adjoining one dimension in a finite direct sum preserves reflexivity. Let be the root space, and let be the unit vector at each node coordinate.
Along every finite branch , the recursive norm is exactlyIndeed, at every step only one child component is occupied, so its norm equals that component's norm, while the node coordinate adds by the sum. Thus embeds by extension into , and its rank is a lower bound for the index, up to the harmless empty-root convention. Countable well-founded trees have arbitrarily high countable ranks: add a root for a successor stage and attach countably many trees of cofinal ranks at a limit stage.
Suppose now a separable reflexive space were universal. Put and choose of height larger than . An isomorphic embedding has bounds . The normalized images along each branch satisfy the lower estimate , so the tree embeds into for some integer . It would have order greater than , contradicting its definition. Therefore no separable reflexive Banach space is universal for all separable reflexive Banach spaces. The embedding constant need not be uniform across spaces; the supremum over all handles this.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use a compatible complete metric on the Polish space . For a tree on a Polish space , letbe its rank of a well-founded tree, with terminal rank zero. We bound this rank using a countable approximation tree, rather than assuming that the original tree has countably many nodes.
Choose a countable base of open balls. A node of the approximation tree at depth records, for every coordinate , a basic ball . Require its diameter to be less than , require , and requireInitial truncation removes the last row of balls. There are only countably many such finite records, so is countable.
An infinite branch in would give, by completeness and shrinking nested balls, a limit for each coordinate. For fixed , witnesses from later levels of have their first coordinates converging to . Initial-segment closure puts those witnesses in , and closedness of puts the limit there too. Hence would be an infinite branch of . Thus is well-founded.
Every tuple can be fitted inside such a record with each . Every extension can be fitted in a child record: shrink the old balls around their actual points and choose a small ball around the new point. A well-founded induction therefore gives whenever the record fits . At the empty record this bounds the whole tree's rank by .
The rank of a countable well-founded tree is countable: at each node it is a supremum of countably many successors of countable ordinals, by well-founded recursion. Consequently a closed well-founded tree on a Polish space has countable height. The completeness and closedness assumptions are precisely what turn a branch of approximation records into an actual branch.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Gowers dichotomy theorem states that every infinite-dimensional Banach space contains either an unconditional basic sequence or a hereditarily indecomposable subspace. Choose an initial basic sequence; it suffices to prove the result for its closed span , with basis constant .
We use the following precise finite-sequence form of the Gowers Ramsey theorem for Banach spaces. Let be an analytic family of finite normalized block sequences, large in the sense that every infinite-dimensional block subspace contains a member. Given positive errors , some infinite-dimensional block subspace makes strategically large. Here consists of tuples within coordinatewise of a member of . In the block game the subspace player chooses an infinite-dimensional block subspace at each turn; the vector player chooses a successive unit vector in it and can force a finite initial segment into . This is the Ramsey theorem permitted without proof, not the dichotomy conclusion.
Assume contains no unconditional basic sequence. For , let be the finite normalized block tuples for which the odd and even spans contain unit vectors with . This family is analytic: in each finite length the witness coefficients and vectors range over finite-dimensional scalar spaces, and the strict distance test is continuous; taking a countable union of finite-support choices gives the block family.
It is large. Indeed, every block subspace has a conditional block basis, with coordinate projections of unbounded norms. Given a finite combination , choose a set of coordinates with arbitrarily large relative to . Put , . Then and , soGroup consecutive nonzero terms belonging to the same side into a single block, and normalize each group. The groups alternate between the two sides, and their odd and even spans contain these two normalized vectors. Interchanging their names if necessary gives a member of .
Choose with . A game tuple in actually belongs to . To check the perturbation explicitly, each coefficient of a unit vector in a normalized block tuple is bounded by . Replacing its coordinates by their nearby game vectors changes it by at most . Normalizing again changes the vector by at most twice that amount. Doing this for the two witnesses adds at most to their distance.
The Ramsey theorem thus supplies a block subspace on which the vector player can force odd and even spans to contain unit vectors within . Given any two infinite-dimensional block subspaces of that space, let the subspace player choose them alternately, using their successive tails to satisfy support order. The strategy produces the odd vectors in and the even vectors in , so these subspaces contain the required nearby unit vectors.
Repeat inside decreasing block subspaces with , and choose a diagonal normalized block sequence with . Its tail from onward lies in . In , any two infinite-dimensional block subspaces can be restricted to this tail, hence contain unit vectors at distance less than for every .
Finally this zero-angle statement extends to arbitrary infinite-dimensional closed subspaces of . Choose unit vectors in each subspace annihilating the first successively many basis coordinates, and approximate them by finite successive blocks with summably small errors. The coordinate bound makes the resulting map from the block span to the original subspace arbitrarily close to the identity in operator norm. Apply the block-subspace zero-angle result and normalize the transported vectors; their added error can be made arbitrarily small. Thus the unit spheres of have distance zero.
By the equivalence proved in part (a), is hereditarily indecomposable. This proves the dichotomy, including the passage from block subspaces to all subspaces.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For the construction, use the standard basic-sequence selection procedure. At stage , choose finitely many functionals which almost norm the unit sphere of the finite-dimensional span of the vectors already chosen. Put the next vector in their common kernels, and in the analogous kernels retained from earlier stages. These impose only finite codimension. Choosing the norming tolerances with a finite product gives a uniformly bounded basis constant, which may be fixed in advance, for example below two. The hypothesis then supplies a unit vector in this finite-codimensional subspace with image smaller than the prescribed . This yields the requested normalized basic sequence.
For strict singularity, fix and make the construction with a summable sequence satisfying , where is the controlled basis constant. For , the coordinate bound givesBy density this holds on the infinite-dimensional closed span .
If were bounded below by on some infinite-dimensional subspace , choose . Hereditary indecomposability supplies unit vectors arbitrarily close. Thena contradiction for sufficiently close vectors. Therefore is a strictly singular operator, equivalently every infinite-dimensional subspace contains a unit vector with arbitrarily small image. The case is immediate.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
An infinite-dimensional Banach space is a hereditarily indecomposable Banach space when no closed infinite-dimensional subspace of splits as a topological direct sum of two infinite-dimensional closed subspaces. Finite-dimensional summands are not forbidden.
A useful equivalent formulation is that for every pair of infinite-dimensional closed subspaces and every , there are unit vectors with . To see the equivalence, a topological direct sum has bounded coordinate projections and hence a positive separation between its two unit spheres. Conversely, if the two unit spheres have separation , then and addition is bounded below on : after factoring out the larger of , the triangle inequality and the separation bound give a positive lower bound for . Its range is therefore closed and supplies the forbidden decomposition.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Choose a normalized basic sequence in the infinite-dimensional Banach space, and apply the Rosenthal l1 theorem. If a subsequence is equivalent to the unit vector basis of , any spreading model generated from a further subsequence retains its two-sided estimates and is therefore unconditional.
Otherwise there is a weakly Cauchy sequence as a subsequence , still basic. Its consecutive differences are weakly null and are a block sequence. The coordinate-functional bound for its normalized parent basis gives . Hence is a normalized weakly null basic sequence. Part (a) gives a spreading model, and part (b) makes that model one-suppression-unconditional. Thus every infinite-dimensional Banach space has an unconditional spreading model, even though it need not contain an unconditional basic sequence.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write for the limiting spreading model norm. We show that deleting any one coefficient does not increase it; iteration then gives every finite suppression.
Fix an index , the coefficients, and a small . Choose a generation threshold so that all the relevant full and shortened combinations beyond it approximate their model norms within . Fix the indices before position beyond this threshold. Since is a weakly null sequence, the Mazur lemma gives a finite convex combinationwith every after the fixed prefix. Choose the remaining indices after . For every , the full ordered combination with in slot has norm at most . Averaging these combinations givesThe shortened combination has norm at most , and approximates its own model norm within . Letting provesfor every finite set . Thus the model is a suppression-unconditional basic sequence with constant one. The convex-combination argument allows the omitted coordinate to sit between two retained coordinates; simply letting a single omitted index tend to infinity with all others fixed would not respect their order.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 11 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The infinite Ramsey theorem used here says that every finite colouring of the -element subsets of an infinite subset of has an infinite homogeneous subset. Let be normalized with basis constant .
For each positive integer , rational scalar tuple and precision , colour increasing -tuples according to intervals of length containing . This is a finite colouring, because all these norms lie between zero and . Enumerate the countably many triples and repeatedly apply the Ramsey theorem, obtaining decreasing infinite sets on which each specified norm has oscillation at most . Choose a diagonal subsequence whose tail is contained in every previously selected infinite set.
Consequently, for every rational tuple , the net of norms over increasing tuples from is Cauchy as its first index tends to infinity. Denote its limit by . This extends to arbitrary scalar tuples becauseuniformly in the indices. For complex scalars use rational real and imaginary parts. The same estimate proves convergence uniformly over all sufficiently late increasing tuples for each fixed scalar tuple.
Homogeneity and the triangle inequality pass to the limit. The coordinate functionals of a normalized basic sequence have norm at most , since the coordinate projection is the difference of two initial projections. Thusso is a genuine norm. Zero coefficients may be inserted anywhere without changing the value: removing those coordinates simply selects another increasing tuple for the same limiting combination. Also every initial-segment projection has norm at most , by the corresponding inequality for . Completing the finitely supported scalar sequences in therefore gives a Banach space with a normalized basic sequence .
Its finite norms are invariant under increasing relabellings, by the zero-insertion observation, andThis is the required spreading model, generated by the diagonal subsequence.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 1 6 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The single bonds give equal simple-root lengths and inner products, after normalization,The positive roots of this A3 root system areThe first two sums are roots by the qualified obtuse-root lemma. The last is a root because . All have nonnegative simple-root coordinates, hence are positive.
To prove completeness, first note that every root is Weyl-conjugate to a simple root. For a nonsimple positive root , some , since . Reflection subtracts a positive integer multiple of , decreasing its integer height. The reflected root stays positive: it leaves the coefficients at all other simple roots unchanged, at least one of which is positive; a root has coordinates all of one sign. Repeating this height decrease reaches a simple root. Thus every root has squared length two in this connected single-bond system.
Write an arbitrary positive root as , with nonnegative integers . Its squared length condition isThus . For the equation gives ; for or it gives or ; for it gives . These are exactly the six coefficient triples in the displayed list. This proves completeness from the axioms, not merely from recognizing the Dynkin diagram.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 1 6 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Choose a linear functional which is nonzero on every root; one exists because there are only finitely many root hyperplanes to avoid. Declare a root positive when , and negative when . This orders the roots by sign, compatibly with addition whenever the sum is a root. One can refine it to a lexicographic total order by completing to a coordinate system. Since negation permutes the roots,A simple root is a positive root not expressible as the sum of two positive roots. If distinct simple roots had as a root, it would be either positive or negative. In the first case decomposes into two positive roots; in the second decomposes . Both contradict simplicity. If they are equal, their difference is zero and is also not a root. Hence the difference of two simple roots is never a root.
For use in the final subpart, the simple roots form a basis, and every positive root is a nonnegative integer combination of them. Here are the needed reasons. Repeatedly decompose a nonsimple positive root into two positive roots; their values decrease, and the finite root set makes this terminate. This gives the integer combinations. Distinct simple roots have nonpositive inner product: a positive inner product would make and obtuse, so the qualified root-sum lemma would make a root, just ruled out. Finally, a nontrivial linear relation between simple roots can be split into positive and negative coefficients, giving the same vector as positive combinations of disjoint sets. Its squared norm, computed using those two expressions, is nonpositive, whereas a nonzero positive combination has positive value. This contradiction proves linear independence. Their span is because they generate all roots.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 1 6 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
There is an exception to the printed assertion: for , the inner product is negative but is not a root. This already occurs in the rank-one root system .
For the intended assertion, assume . By the preceding list, at least one of equals . If the first does, the reflection axiom givesIf the second does, use instead. Thus the precise reusable conclusion isThis proves that obtuse nonopposite roots have a root sum directly from the reflection and integrality axioms, without appealing to the classification of root systems.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 1 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
If , then both Cartan integers are . This opposite-root case satisfies the printed inner-product hypothesis and must be included.
Otherwise reducedness makes the roots nonproportional. Writing the angle as , strict Cauchy-Schwarz inequality givesBoth factors are negative integers, so their product is or . The full list is thereforeThe nonproportional pairs correspond respectively to angles , and ; reversing the order of the roots reverses the unequal pairs.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





