Relevant bibliographies by topics / Common divisor

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Common divisor'

Author: Grafiati
Published: 4 June 2021
Last updated: 15 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Common divisor.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Common divisor"

1

Beslin, Scott, and Steve Ligh. "Greatest common divisor matrices." Linear Algebra and its Applications 118 (June 1989): 69–76. http://dx.doi.org/10.1016/0024-3795(89)90572-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Belenkiy, Ari, and Raimundas Vidunas. "A Greatest Common Divisor Algorithm." International Journal of Algebra and Computation 08, no. 05 (October 1998): 617–23. http://dx.doi.org/10.1142/s0218196798000296.

Full text
Abstract:
Algorithms of computation of the Greatest Common Divisor (GCD) of two integers play a principal role in all computational systems dealing with rational arithmetic. The simplest one (Euclidean) is not the best for large numbers (see D. E. Knuth's book "The Art of Computer Programming" for details). One improvement was suggested by D. H. Lehmer in 1938 who noticed that it is possible to run the Euclidean algorithm with a few leading digits of large numbers and, with some care, still obtain the correct answer. In the 70's G. E. Collins pointed out that Lehmer's algorithm simultaneously analyzed two similar sequences of numbers and hence did twice as much work as necessary. Collins found a way to work with only one sequence of numbers together with a verification of a certain inequality. The proof of the validity of this inequality is, perhaps, too complicated. We present a similar but softer inequality and give a short and simple proof thereof.
APA, Harvard, Vancouver, ISO, and other styles
3

Koryukin, A. N., A. M. Sebeldin, and A. L. Sylla. "Rings with the greatest common divisor." Journal of Mathematical Sciences 183, no. 3 (May 3, 2012): 319–22. http://dx.doi.org/10.1007/s10958-012-0817-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lindqvist, Peter, and Kristian Seip. "Note on some greatest common divisor matrices." Acta Arithmetica 84, no. 2 (1998): 149–54. http://dx.doi.org/10.4064/aa-84-2-149-154.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhukov, Kirill Dmitrievich. "Approximate common divisor problem and lattice sieving." Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] 9, no. 2 (2018): 87–98. http://dx.doi.org/10.4213/mvk257.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Galbraith, Steven D., Shishay W. Gebregiyorgis, and Sean Murphy. "Algorithms for the approximate common divisor problem." LMS Journal of Computation and Mathematics 19, A (2016): 58–72. http://dx.doi.org/10.1112/s1461157016000218.

Full text
Abstract:
The security of several homomorphic encryption schemes depends on the hardness of variants of the approximate common divisor (ACD) problem. We survey and compare a number of lattice-based algorithms for the ACD problem, with particular attention to some very recently proposed variants of the ACD problem. One of our main goals is to compare the multivariate polynomial approach with other methods. We find that the multivariate polynomial approach is not better than the orthogonal lattice algorithm for practical cryptanalysis.We also briefly discuss a sample-amplification technique for ACD samples and a pre-processing algorithm similar to the Blum–Kalai–Wasserman algorithm for learning parity with noise. The details of this work are given in the full version of the paper.
APA, Harvard, Vancouver, ISO, and other styles
7

Pollack, Paul. "On the greatest common divisor of a number and its sum of divisors." Michigan Mathematical Journal 60, no. 1 (April 2011): 199–214. http://dx.doi.org/10.1307/mmj/1301586311.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Oka, Satomi. "On the common divisor of discriminants of integers." Tsukuba Journal of Mathematics 26, no. 1 (June 2002): 69–78. http://dx.doi.org/10.21099/tkbjm/1496164382.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Olson, Melfried. "Activities: A Geometric Look at Greatest Common Divisor." Mathematics Teacher 84, no. 3 (March 1991): 202–8. http://dx.doi.org/10.5951/mt.84.3.0202.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Heyman, Randell, and Igor E. Shparlinski. "On the greatest common divisor of shifted sets." Journal of Number Theory 154 (September 2015): 63–73. http://dx.doi.org/10.1016/j.jnt.2015.02.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Common divisor"

1

Halawani, Hanan. "Blind image deconvolution using approximate greatest common divisor and approximate polynomial factorisation." Thesis, University of Sheffield, 2018. http://etheses.whiterose.ac.uk/20141/.

Full text
Abstract:
Images play a significant and important role in diverse areas of everyday modern life. Examples of the areas where the use of images is routine include medicine, forensic investigations, engineering applications and astronomical science. The procedures and methods that depend on image processing would benefit considerably from images that are free of blur. Most images are unfortunately affected by noise and blur that result from the practical limitations of image sourcing systems. The blurring and noise effects render the image less useful. An efficient method for image restoration is hence important for many applications. Restoration of true images from blurred images is the inverse of the naturally occurring problem of true image convolution through a blurring function. The deconvolution of images from blurred images is a non-trivial task. One challenge is that the computation of the mathematical function that represents the blurring process, which is known as the point spread function (PSF), is an ill-posed problem, i.e. an infinite number of solutions are possible for given inexact data. The blind image deconvolution (BID) problem is the central subject of this thesis. There are a number of approaches for solving the BID problem, including statistical methods and linear algebraic methods. The approach adopted in this research study for solving this problem falls within the class of linear algebraic methods. Polynomial linear algebra offers a way of computing the PSF size and its components without requiring any prior knowledge about the true image and the blurring PSF. This research study has developed a BID method for image restoration based on the approximate greatest common divisor (AGCD) algorithms, specifically, the approximate polynomial factorization (APF) algorithm of two polynomials. The developed method uses the Sylvester resultant matrix algorithm in the computation of the AGCD and the QR decomposition for computing the degree of the AGCD. It is shown that the AGCD is equal to the PSF and the deblurred image can be computed from the coprime polynomials. In practice, the PSF can be spatially variant or invariant. PSF spatial invariance means that the blurred image pixels are the convolution of the true image pixels and the same PSF. Some of the PSF bivariate functions, in particular, separable functions, can be further simplified as the multiplication of two univariate polynomials. This research study is focused on the invariant separable and non-separable PSF cases. The performance of state-of-the-art image restoration methods varies in terms of computational speed and accuracy. In addition, most of these methods require prior knowledge about the true image and the blurring function, which in a significant number of applications is an impractical requirement. The development of image restoration methods that require no prior knowledge about the true image and the blurring functions is hence desirable. Previous attempts at developing BID methods resulted in methods that have a robust performance against noise perturbations; however, their good performance is limited to blurring functions of small size. In addition, even for blurring functions of small size, these methods require the size of the blurring functions to be known and an estimate of the noise level to be present in the blurred image. The developed method has better performance than all the other state-of-the-art methods, in particular, it determines the correct size and coefficients of the PSF and then uses it to recover the original image. It does not require any prior knowledge about the PSF, which is a prerequisite for all the other methods.
APA, Harvard, Vancouver, ISO, and other styles
2

Freitas, Carlos Wagner Almeida. "EquaÃÃes diofantinas." Universidade Federal do CearÃ, 2015. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=14655.

Full text
Abstract:
CoordenaÃÃo de AperfeÃoamento de Pessoal de NÃvel Superior
O atual trabalho tem como objetivo principal estruturar estudantes, professores e amantes da matemÃtica para a melhor compreensÃo, interpretaÃÃo e resoluÃÃo de problemas que venham a ser solucionados usando-se as EquaÃÃes Diofantinas. Para isso, foram usadas tÃcnicas como o uso de inequaÃÃes e o mÃtodo paramÃtrico que sÃo conteÃdos estudados pelos professores do Ensino Fundamental e MÃdio. TambÃm foi utilizada para isso a apresentaÃÃo de vÃrios exemplos, todos resolvidos, que servirÃo como objeto de estudo para professores, universitÃrios, estudantes escolares e amantes da matemÃtica. No primeiro capÃtulo abordaremos os fatos histÃricos de grandes matemÃticos que contribuÃram com o desenvolvimento das EquaÃÃes Diofantinas. Jà no segundo capÃtulo, vamos conhecer melhor a essÃncia da Teoria Elementar dos NÃmeros, apresentando, demonstrando e exemplificando as ferramentas matemÃticas que serÃo utilizadas na resoluÃÃo das EquaÃÃes Diofantinas. Por fim, no terceiro capÃtulo, introduziremos as EquaÃÃes Diofantinas e os mÃtodos de determinaÃÃo de soluÃÃes das mesmas, aplicando-as em situaÃÃes-problema do cotidiano. A conclusÃo desse trabalho enfatiza a importÃncia da compreensÃo algÃbrica e geomÃtrica das EquaÃÃes Diofantinas, e que o contato com problemas desta Ãrea contribua para que o leitor desenvolva de modo criativo, suas habilidades cognitivas. à importante ressaltar que a introduÃÃo à resoluÃÃo de problemas dessa natureza nÃo necessita de conhecimentos superiores, podendo ser abordado no Ensino Fundamental e MÃdio.
The current work has as objective main to structuralize students, professors and loving of the mathematics for the best understanding, interpretation and resolution of problems that come to be solved using the Diofantinas Equations. For this, they had been used techniques as the use of inequalities and the parametric method that are contents studied for the professors of Basic and Average Education. Also the presentation of some examples, all decided, that they will serve as object of study for professors, collegeâs student was used for this, pertaining to school and loving students of the mathematics. In the first chapter we will approach the facts historical of great mathematicians who had contributed with the development of the Diofantinas Equations. No longer according to chapter, we go to better know the essence of the Elementary Theory of the Numbers, presenting, demonstrating and exemplifying the mathematical tools that will be used in the resolution of the Diofantinas Equations. Finally, in the third chapter, we will introduce the Diofantinas Equations and the methods of determination of solutions of the same one, applying them in situation-problem of the daily one. The conclusion of this work emphasizes the importance of the algebraic and geometric understanding of the Diofantinas Equations, and that the contact with problems of this area contributes so that the reader develops in creative way, its cognitive abilities. It is important to stand out that the introduction to the resolution of problems of this nature does not need superior knowledge, being able to be boarded in Basic and Average education.
APA, Harvard, Vancouver, ISO, and other styles
3

Valentim, Erivan Sousa. "A divisibilidade no Ensino Fundamental." Universidade Estadual da Paraíba, 2017. http://tede.bc.uepb.edu.br/jspui/handle/tede/2828.

Full text
Abstract:
Submitted by Jean Medeiros (jeanletras@uepb.edu.br) on 2017-07-20T17:14:06Z No. of bitstreams: 1 PDF - Erivan Sousa Valentim.pdf: 10186922 bytes, checksum: ffae32fb65fe99f5c16bf7b416d3008d (MD5)
Approved for entry into archive by Secta BC (secta.csu.bc@uepb.edu.br) on 2017-08-29T15:42:48Z (GMT) No. of bitstreams: 1 PDF - Erivan Sousa Valentim.pdf: 10186922 bytes, checksum: ffae32fb65fe99f5c16bf7b416d3008d (MD5)
Made available in DSpace on 2017-08-29T15:42:48Z (GMT). No. of bitstreams: 1 PDF - Erivan Sousa Valentim.pdf: 10186922 bytes, checksum: ffae32fb65fe99f5c16bf7b416d3008d (MD5) Previous issue date: 2017-06-09
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
The purpose of this work is to realize an approach about multiples and divisors, in- cluding the least common multiple and the greatest common divisor, owing to the difficulty that students feel when they faced with such content in basic education, aiming at a better understanding about it and an improvement in the learning of le- arners. The suggestion was applied in an 8th grade class at the Joaquim Limeira de Queiroz Agricultural Technical School, in the city of Puxinan˜ a - PB, in March 2017. They were addressed the definitions of multiples, divisors, prime numbers and the least common multiple and the greatest common divisor, and it was applied activities such as: bingo of the divisors, the sum of the magic square and the construction of the Sieve of Eratosthenes. Finally, we carried out an evaluation exercise with the objective of analyzing if the results regarding the content and the activities previously proposed were satisfactory.
A proposta deste trabalho é de realizar uma abordagem sobre os múltiplos e divisores, incluindo mínimo múltiplo comum e o máximo divisor comum, tendo em vista a dificuldade que os estudantes sentem ao se deparar com tal conteúdo na educação básica, objetivando um melhor entendimento a cerca do conteúdo e uma melhoria no que diz o respeito a aprendizagem dos educandos. A proposta foi aplicada em uma turma de 8 ano na Escola Técnica Agrícola Joaquim Limeira de Queiroz, na cidade de Puxinanã - PB, no mês de março de 2017. Foram abordados as definições de múltiplos, divisores, números primos e mínimo múltiplo comum e máximo divisor comum, e aplicadas atividades tais como: bingo dos divisores, a soma do quadrado mágico e a construção do Crivo de Eratóstenes. Por fim, realizamos um exercício avaliativo com o objetivo de analisar se os resultados a respeito do conteúdo e das atividades propostas anteriormente foram satisfatórias.
APA, Harvard, Vancouver, ISO, and other styles
4

Santos, Paula Daniele Borges dos. "Relação entre o máximo divisor comum, o mínimo múltiplo comum e o diagrama de Venn." Universidade Federal de Goiás, 2017. http://repositorio.bc.ufg.br/tede/handle/tede/7119.

Full text
Abstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2017-04-11T12:47:20Z No. of bitstreams: 2 Dissertação - Paula Daniele Borges dos Santos - 2017.pdf: 1755533 bytes, checksum: 6efac4df89f983ce6e59731acd88d41a (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-04-11T12:47:44Z (GMT) No. of bitstreams: 2 Dissertação - Paula Daniele Borges dos Santos - 2017.pdf: 1755533 bytes, checksum: 6efac4df89f983ce6e59731acd88d41a (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2017-04-11T12:47:44Z (GMT). No. of bitstreams: 2 Dissertação - Paula Daniele Borges dos Santos - 2017.pdf: 1755533 bytes, checksum: 6efac4df89f983ce6e59731acd88d41a (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2017-03-21
Fundação de Amparo à Pesquisa do Estado de Goiás - FAPEG
The present work intends to show an illustrative approach to calculate and understand Greater Common Divisor and Least Common Multiple, seeking a greater assimilation and concretization of the learning of this content. This methodology is presented in a chromological order following the evolution of mathematical concepts. Therefore, this text, aiming to produce a meaningful approach of the subject, seeks to expose in a simple way what comes to be the Prime Numbers according to Numbers Theory and Venn Diagram according to the Set Theory, in order to visualize and obtain the Relation between Greater Common Divisor, Least Common Multiple, and Venn Diagram.
O presente trabalho pretende mostrar uma abordagem ilustrativa para se calcular e entender Máximo Dividor Comum e Mínimo Múltiplo Comum, buscando uma maior assimilação e concretização da aprendizagem desse conteúdo. Esta metodologia é apresentada numa ordem cronológica seguindo a evolução dos conceitos matemáticos. Logo, este texto, visando produzir uma abordagem significativa do assunto, busca expor de forma simples o que vem a ser os Números Primos segundo a Teoria dos Números e Diagrama de Venn segundo a Teoria dos Conjuntos, para que assim se consiga visualizar e obter a Relação entre Máximo Divisor Comum, Mínimo Múltiplo Comum e o Diagrama de Venn.
APA, Harvard, Vancouver, ISO, and other styles
5

Lao, Xinyuan. "Structured matrix methods for a polynomial root solver using approximate greatest common divisor computations and approximate polynomial factorisations." Thesis, University of Sheffield, 2011. http://etheses.whiterose.ac.uk/12818/.

Full text
Abstract:
This thesis discusses the use of structure preserving matrix methods for the numerical approximation of all the zeros of a univariate polynomial in the presence of noise. In particular, a robust polynomial root solver is developed for the calculation of the multiple roots and their multiplicities, such that the knowledge of the noise level is not required. This designed root solver involves repeated approximate greatest common divisor computations and polynomial divisions, both of which are ill-posed computations. A detailed description of the implementation of this root solver is presented as the main work of this thesis. Moreover, the root solver, implemented in MATLAB using 32-bit floating point arithmetic, can be used to solve non-trivial polynomials with a great degree of accuracy in numerical examples.
APA, Harvard, Vancouver, ISO, and other styles
6

Souza, Leticia Vasconcellos de. "Congruência modular nas séries finais do ensino fundamental." Universidade Federal de Juiz de Fora, 2015. https://repositorio.ufjf.br/jspui/handle/ufjf/1441.

Full text
Abstract:
Submitted by Renata Lopes (renatasil82@gmail.com) on 2016-05-10T13:29:13Z No. of bitstreams: 1 leticiavasconcellosdesouza.pdf: 334599 bytes, checksum: ecaf1358f31b66f2a2e8740f4db33535 (MD5)
Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2016-06-15T13:12:10Z (GMT) No. of bitstreams: 1 leticiavasconcellosdesouza.pdf: 334599 bytes, checksum: ecaf1358f31b66f2a2e8740f4db33535 (MD5)
Made available in DSpace on 2016-06-15T13:12:10Z (GMT). No. of bitstreams: 1 leticiavasconcellosdesouza.pdf: 334599 bytes, checksum: ecaf1358f31b66f2a2e8740f4db33535 (MD5) Previous issue date: 2015-08-14
Este trabalho é voltado para professores que atuam nas séries finais do Ensino Fundamental. Tem como objetivo mostrar que é possível introduzir o estudo de Congruência Modular nesse segmento de ensino, buscando facilitar a resolução de diversas situações-problema. A motivação para escolha desse tema é que há a possibilidade de tornar mais simples a resolução de muitos exercícios trabalhados nessa etapa de ensino e que são inclusive cobrados em provas de admissão à escolas militares e em olimpíadas de Matemática para esse nível de escolaridade. Inicialmente é feita uma breve síntese do conjunto dos Números Inteiros, com suas operações básicas, relembrando também o conceito de números primos, onde é apresentado o crivo de Eratóstenes; o mmc (mínimo múltiplo comum) e o mdc (máximo divisor comum), juntamente com o Algoritmo de Euclides. Apresenta-se alguns exemplos de situações-problema e exercícios resolvidos envolvendo restos deixados por uma divisão para então, em seguida, ser dada a definição de congruência modular. Finalmente, são apresentadas sugestões de exercícios para serem trabalhados em sala de aula, com uma breve resolução.
The aims of this work is teachers working in the final grades of elementary school. It aspires to show that it is possible to introduce the study of Modular congruence this educational segment, seeking to facilitate the resolution of numerous problem situations. The motivation for choosing this theme is that there is the possibility to make it simpler to solve many problems worked at this stage of education and are even requested for admittance exams to military schools and mathematical Olympiads for that level of education. We begin with a brief summary about integer numbers, their basic operations, also recalling the concept of prime numbers, where the sieve of Eratosthenes is presented; the lcm (least common multiple) and the gcd (greatest common divisor), along with the Euclidean algorithm. We present some examples of problem situations and solved exercises involving debris left by a division and then, we give the definition of modular congruence . Finally , we present suggestions for exercises to be worked in the classroom, with a short resolution.
APA, Harvard, Vancouver, ISO, and other styles
7

Silva, Luis Henrique Pereira da. "Uma aplicação da congruência na determinação de critérios de divisibilidade." Universidade Federal de Goiás, 2015. http://repositorio.bc.ufg.br/tede/handle/tede/4600.

Full text
Abstract:
Submitted by Luciana Ferreira (lucgeral@gmail.com) on 2015-10-08T11:31:38Z No. of bitstreams: 2 Dissertação - Luis Henrique Pereira da Silva - 2015.pdf: 1093576 bytes, checksum: 6d4e251c8d5464c6328fb953341355d9 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2015-10-08T12:56:48Z (GMT) No. of bitstreams: 2 Dissertação - Luis Henrique Pereira da Silva - 2015.pdf: 1093576 bytes, checksum: 6d4e251c8d5464c6328fb953341355d9 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)
Made available in DSpace on 2015-10-08T12:56:48Z (GMT). No. of bitstreams: 2 Dissertação - Luis Henrique Pereira da Silva - 2015.pdf: 1093576 bytes, checksum: 6d4e251c8d5464c6328fb953341355d9 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2015-03-27
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
This work aims to demonstrate in a practical way the divisibility criteria 2-97 in sieve Eratostenes with cutting the right and the left, based on the method of multiplication and division Egyptian. The entire process is demonstrated using the divisibility to whole numbers, greatest common divisor, prime numbers, decomposition in prime factors and matching.
Este trabalho tem como objetivo demonstrar de modo prático os critérios de divisibilidade de 2 a 97 no crivo de Eratóstenes com os corte a direita e a esquerda, baseando-se no método de multiplicação e divisão egípcia. Todo processo é demostrado utilizando a divisibilidade para números inteiros, máximo divisor comum, números primos, decomposi ção em fatores primos e congruência.
APA, Harvard, Vancouver, ISO, and other styles
8

Bértolo, Mónica Calvário. "Inteiros Gaussianos." Master's thesis, Universidade de Aveiro, 2015. http://hdl.handle.net/10773/16826.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Banava, Helen. "Inherited risk for common disease." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/39908.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Biological Engineering Division, 2007.
Includes bibliographical references (leaves 149-151).
Linkage disequilibrium studies have discovered few gene-disease associations for common diseases. The explanation has been offered that complex modes of inheritance govern risk for cancers, cardiovascular and cerebrovascular diseases, and diabetes. Such studies, however, depended on the untested assumption of monoallelic risk. My research advisor and I set out to investigate whether simple forms of inherited risk, monoallelic or multiallelic, could be excluded by analysis of familial risk for a common disease, such as colorectal cancer (CRC). First, we derived formulae that describe the risk for monogenic, multigenic, and polygenic possibilities of Mendelian inheritance. Next, we obtained an estimate of minimum lifetime risk for CRC of >0.26. Then, we examined the case of late-onset CRC, using the Swedish Family Cancer Database (1958-2002) to estimate the familial relative risk for CRC diagnosis at age 50 or older, and obtained an estimated range of 1.5 to 3.0. We compared this range of actual values to the ranges of expected values for monogenic, multigenic, and polygenic modes of inheritance.
(cont.) We delimited bounds that can be placed on the conditions for various modes of inheritance. The key observation is that monogenic risk for CRC is included among various possibilities, and cannot be eliminated by existing observations. The arguments herein indicate that further efforts can and should be made to obtain more precise estimates of familial risk for CRC and other common forms of cancer.
by Helen Banava.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
10

John, Shirley Diane. "The analysis of House of Commons' division list data." Thesis, University of Bath, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.235796.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Common divisor"

1

A, St John Philip. Fifth Marine Division: Uncommon valor was a common virtue. Paducah, Ky: Turner Pub. Co., 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Korzen, Chris. A nation for all: How the Catholic vision of the common good can save America from the politics of division. San Francisco: Jossey-Bass, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Korzen, Chris. A nation for all: How the Catholic vision of the common good can save America from the politics of division. San Francisco: Jossey-Bass, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

A nation for all: How the Catholic vision of the common good can save America from the politics of division. San Francisco, CA: Jossey-Bass, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Malvestuto, Sharon P. Electronic filing in the Philadelphia Court of Common Pleas: Criminal Trial Division. Mechanicsburg, Pennsylvania: Pennsylvania Bar Institute, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vohra, Neharika. Perspectives on some of the common categories of exclusion and inclusion. Ahmedabad: Indian Institute of Management, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kahan, James P. Corps and division command staff turnover in the 1980's. Santa Monica, CA: Rand Corp, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Auditor, North Carolina Office of the State. Audit of the Department of Correction, Division of Prisons, Youth Command. [Raleigh, N.C.] (300 N. Salisbury St., Raleigh 27603-5903): The Office, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Fallesen, Jon J. Assessment of the Operations Planning Tools (OPT) during a division-level command post exercise. Alexandria, VA: United States Army Research Institute for the Behavioral and Social Sciences, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nottingham, William J. Origin and legacy of the Common Global Ministries Board: A history of the Christian Church (Disciples of Christ) in world mission. Nashville, Tennessee: Disciples of Christ Historical Society, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Common divisor"

1

Contini, Scott. "Greatest Common Divisor." In Encyclopedia of Cryptography and Security, 518–19. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_453.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Majewski, Bohdan S., and George Havas. "The complexity of greatest common divisor computations." In Lecture Notes in Computer Science, 184–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58691-1_56.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dijkstra, Edsger W. "Fibonacci and the greatest common divisor (EWD1077)." In Deductive Program Design, 7–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-642-61455-2_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Diaconis, Persi, and Paul Erdös. "On the distribution of the greatest common divisor." In Institute of Mathematical Statistics Lecture Notes - Monograph Series, 56–61. Beachwood, Ohio, USA: Institute of Mathematical Statistics, 2004. http://dx.doi.org/10.1214/lnms/1196285379.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Galligo, André, Loïc Pottier, and Carlo Traverso. "Greater easy common divisor and standard basis completion algorithms." In Symbolic and Algebraic Computation, 162–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51084-2_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Leizhang, Quanbo Qu, Tuoyan Li, and Yange Chen. "Implementing Attacks on the Approximate Greatest Common Divisor Problem." In Communications in Computer and Information Science, 209–27. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-15-0818-9_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rössner, Carsten, and Jean-Pierre Seifert. "The complexity of approximate optima for greatest common divisor computations." In Lecture Notes in Computer Science, 307–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61581-4_64.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Xu, Jun, Santanu Sarkar, and Lei Hu. "Revisiting Approximate Polynomial Common Divisor Problem and Noisy Multipolynomial Reconstruction." In Lecture Notes in Computer Science, 398–411. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-35423-7_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Triantafyllou, D., and M. Mitrouli. "Two Resultant Based Methods Computing the Greatest Common Divisor of Two Polynomials." In Lecture Notes in Computer Science, 519–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31852-1_63.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Manev, Nikolai L. "On the Relation Between Matrices and the Greatest Common Divisor of Polynomials." In Large-Scale Scientific Computing, 191–99. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26520-9_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Common divisor"

1

Mansour, Y., B. Schieber, and P. Tiwari. "Lower bounds for integer greatest common divisor computations." In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. IEEE, 1988. http://dx.doi.org/10.1109/sfcs.1988.21921.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Karcanias, N., S. Fatouros, M. Mitrouli, and G. Halikias. "Approximate greatest common divisor of many polynomials and generalised resultants." In 2003 European Control Conference (ECC). IEEE, 2003. http://dx.doi.org/10.23919/ecc.2003.7086598.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Siddhartha, M., Jelwin Rodriques, and B. R. Chandavarkar. "Greatest common divisor and its applications in security: Case study." In 2020 International Conference on Interdisciplinary Cyber Physical Systems (ICPS). IEEE, 2020. http://dx.doi.org/10.1109/icps51508.2020.00015.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Halikias, G., S. Fatouros, and N. Karcanias. "Approximate greatest common divisor of polynomials and the structured singular value." In 2003 European Control Conference (ECC). IEEE, 2003. http://dx.doi.org/10.23919/ecc.2003.7086599.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Abramov, S. A., and K. Yu Kvashenko. "On the greatest common divisor of polynomials which depend on a parameter." In the 1993 international symposium. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/164081.164112.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rahman, Md Moshiur, Md Nur Al Safa Bhuiyan, Muhammad Sajjadur Rahim, and Sabbir Ahmed. "A lightweight PAPR reduction scheme using Greatest Common Divisor matrix based SLM technique." In 2016 9th International Conference on Electrical and Computer Engineering (ICECE). IEEE, 2016. http://dx.doi.org/10.1109/icece.2016.7853964.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Samanta, D., Asish Kumar De, and S. K. Sarkar. "Computing Greatest Common Divisor of two positive integers using SET-MOS hybrid architecture." In 2012 International Conference on Devices, Circuits and Systems (ICDCS 2012). IEEE, 2012. http://dx.doi.org/10.1109/icdcsyst.2012.6188800.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Isa, Siti Nor Asiah binti, Nor’aini Aris, and Shazirawati Mohd Puzi. "Numerical matrix methods in the computation of the greatest common divisor (GCD) of polynomials." In INTERNATIONAL CONFERENCE ON MATHEMATICS, ENGINEERING AND INDUSTRIAL APPLICATIONS 2016 (ICoMEIA2016): Proceedings of the 2nd International Conference on Mathematics, Engineering and Industrial Applications 2016. Author(s), 2016. http://dx.doi.org/10.1063/1.4965184.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lestari, Ana Puji, Erry Hidayanto, and Sukoriyanto. "Proactive interference of seventh grade students in solving problems of the greatest common divisor." In THE 4TH INTERNATIONAL CONFERENCE ON MATHEMATICS AND SCIENCE EDUCATION (ICoMSE) 2020: Innovative Research in Science and Mathematics Education in The Disruptive Era. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0043382.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rahman, Md Moshiur, Muhammad Sajjadur Rahim, Md Nur Al Safa Bhuiyan, and Sabbir Ahmed. "Greatest common divisor matrix based phase sequence for PAPR reduction in OFDM system with low computational overhead." In 2015 International Conference on Electrical & Electronic Engineering (ICEEE). IEEE, 2015. http://dx.doi.org/10.1109/ceee.2015.7428228.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Common divisor"

1

Lodder, Jerry, David Pengelley, and Desh Ranjan. Euclid's Algorithm for the Greatest Common Divisor. Washington, DC: The MAA Mathematical Sciences Digital Library, June 2013. http://dx.doi.org/10.4169/loci003985.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bluteau, Paul E., Randall D. Bookout, Stephen C. Main, and Michael A. Pearson. Experiences in Division Command. Fort Belvoir, VA: Defense Technical Information Center, April 1993. http://dx.doi.org/10.21236/ada264584.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ulmer, Walter F., Shaler Jr., Bullis Michael D., DiClemente R. C., Jacobs Diane F., Shambach T. O., and Steven A. Leadership Lessons at Division Command Level - 2004. Fort Belvoir, VA: Defense Technical Information Center, November 2004. http://dx.doi.org/10.21236/ada435928.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lobdell, III, and Harrison. Division Command Interviews: Do They Reflect Reality? Fort Belvoir, VA: Defense Technical Information Center, March 1989. http://dx.doi.org/10.21236/ada209581.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Andrews, Edward L. The Army of Excellence and the Division Support Command. Fort Belvoir, VA: Defense Technical Information Center, May 1986. http://dx.doi.org/10.21236/ada168150.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nisar, Mohammad, Attaullah Mian, Ajmal Iqbal, Zakia Ahmad, Nazim Hassan, Muhammad Laiq, Muhammad Salam, and Fatih Hanci. A Detailed Characterization of the Common Bean Genetic Diversity in the Hidden Gene Center of Pakistan: Malakand Division. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, June 2020. http://dx.doi.org/10.7546/crabs.2020.06.09.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bornman, Louis G., Michael C. Ingram, and Peter J. Martin. Information Technology in the Digitized Division. FY95 Mobile Strike Force Battle Command Experiment,. Fort Belvoir, VA: Defense Technical Information Center, November 1995. http://dx.doi.org/10.21236/ada306004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Stackpole, Patrick T. Command and Control of the Second Infantry Division - Route to a Stronger Alliance. Fort Belvoir, VA: Defense Technical Information Center, March 2004. http://dx.doi.org/10.21236/ada424377.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kral, Anthony H. Fueling the Force: Can the Division Support Command (DISCOM) Provide Sufficient Petroleum Support to Sustain a Heavy Division in the Offense. Fort Belvoir, VA: Defense Technical Information Center, October 1990. http://dx.doi.org/10.21236/ada251875.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Decamp III, William T. Maritime Prepositioning Forces (MPF) in Central Command in the 1990s: Force Multiplier or Force Divider? Fort Belvoir, VA: Defense Technical Information Center, January 1992. http://dx.doi.org/10.21236/ada249957.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Common divisor' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography